{"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.379758,0.000654985,0.6159132,0.0017595238,0.00017511417,0.00018543891,0.00002098786,0.00010866272,0.0014240444],"genre_scores_gemma":[0.9645293,0.000026808806,0.034445398,0.0006211186,0.00006161329,0.000016706239,0.00004710511,0.000008659456,0.00024331376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982278,0.000093691066,0.0003855592,0.00057210267,0.00039979417,0.00032107727],"domain_scores_gemma":[0.9990301,0.0003471662,0.00009760471,0.0002682061,0.00012905175,0.00012787759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033253126,0.00018770232,0.00020933687,0.00042835265,0.00017607593,0.00019339549,0.00032937038,0.00006246309,0.0001036838],"category_scores_gemma":[0.00016028144,0.00018959779,0.000061400875,0.0013853482,0.000099078294,0.0007507252,0.00022608752,0.00016668362,0.000048988495],"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.000035278554,0.00042162155,0.05301203,0.00009175942,0.00006116446,0.000066472305,0.0020692253,0.25767365,0.00023467687,0.53572774,0.004500812,0.14610557],"study_design_scores_gemma":[0.000535472,0.00006911775,0.24474001,0.000016127566,0.0000030292065,0.000038406986,0.000051345578,0.6851306,0.00004534786,0.06683482,0.0022641155,0.00027161776],"about_ca_topic_score_codex":0.00004022175,"about_ca_topic_score_gemma":0.00002372729,"teacher_disagreement_score":0.5847713,"about_ca_system_score_codex":0.00006504263,"about_ca_system_score_gemma":0.000039172548,"threshold_uncertainty_score":0.77315736},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45157248,0.00065201137,0.5401483,0.0010910948,0.0011085689,0.001417052,0.0011805524,0.0003434327,0.0024865123],"genre_scores_gemma":[0.8775138,0.000016118434,0.12173219,0.00008087129,0.00019965452,0.00004903352,0.00025232194,0.00009506701,0.000060908747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962055,0.00031221943,0.0013109563,0.00088570325,0.00089933636,0.0003862619],"domain_scores_gemma":[0.99260277,0.005002982,0.0009831518,0.000803723,0.0003361542,0.00027120684],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00085845724,0.00060682505,0.0012550268,0.00026671746,0.00012508697,0.000081534694,0.0006573633,0.00034103158,0.00013526906],"category_scores_gemma":[0.003407711,0.00059066963,0.0003779353,0.00041348825,0.0004564501,0.00014462663,0.002160312,0.00090300845,0.000015490263],"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.00014766728,0.00019428233,0.0012907005,0.0028762782,0.00043208635,0.000010111755,0.0010176639,0.0027991442,0.00009528019,0.98990536,0.00040354725,0.00082786544],"study_design_scores_gemma":[0.0005419843,0.00010671708,0.0029059695,0.00034662298,0.00020737435,0.000010522765,0.00022564494,0.0067584775,0.00017828184,0.9881178,0.00006640661,0.0005342087],"about_ca_topic_score_codex":0.000006728218,"about_ca_topic_score_gemma":7.8522396e-7,"teacher_disagreement_score":0.42594135,"about_ca_system_score_codex":0.000113787595,"about_ca_system_score_gemma":0.00023375396,"threshold_uncertainty_score":0.9996545},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9587998,0.00009326763,0.035674095,0.00029459526,0.0000636056,0.00012064457,0.000016217873,0.00005396004,0.004883853],"genre_scores_gemma":[0.9910394,0.0000034858747,0.00840228,0.00025408858,0.0000474488,0.0000020829352,0.00003300346,0.000009611414,0.00020862877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989938,0.00007025749,0.00026940275,0.00020184739,0.000320774,0.00014393276],"domain_scores_gemma":[0.99881166,0.00076183304,0.00013461281,0.00014226267,0.00008220584,0.00006742464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003755543,0.0001320409,0.00020993735,0.00022939833,0.0000682735,0.000016201793,0.000090859154,0.000066469926,0.00011253553],"category_scores_gemma":[0.00038657823,0.00012047816,0.00006422421,0.00036088115,0.00007069319,0.00009010836,0.000023943103,0.00011831239,0.000017734881],"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.00007649662,0.000120288205,0.00050303416,0.00004308647,0.000029988554,0.0000034698407,0.0001807276,0.0009093737,0.00007055238,0.9920596,0.00037135184,0.005632034],"study_design_scores_gemma":[0.00038123492,0.00023802753,0.04319821,0.0000700824,0.000020889953,0.000015178442,0.00007187389,0.0013593772,0.00025864353,0.9542189,0.000037168913,0.00013041987],"about_ca_topic_score_codex":0.000002238601,"about_ca_topic_score_gemma":1.9571e-7,"teacher_disagreement_score":0.042695176,"about_ca_system_score_codex":0.000017808565,"about_ca_system_score_gemma":0.00001926016,"threshold_uncertainty_score":0.49129567},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9304733,0.00024100237,0.057139337,0.0013076486,0.00045121985,0.0002265595,0.000049195452,0.00005953228,0.010052197],"genre_scores_gemma":[0.989834,0.000001096804,0.009004048,0.00013735762,0.00008057506,0.0000059129975,0.00002054778,0.000014053756,0.0009023686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987866,0.0000730598,0.00033436934,0.00016467687,0.00046460208,0.00017667022],"domain_scores_gemma":[0.99847966,0.00073315814,0.0001987246,0.00024669306,0.00025356142,0.00008821331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030002405,0.00011429699,0.00020085405,0.00023578887,0.00008621311,0.000014069282,0.00027901176,0.0000641326,0.00015975228],"category_scores_gemma":[0.0009831153,0.000080608545,0.0001168702,0.0013717288,0.0001552007,0.000063494976,0.00012931562,0.00012631362,0.00005194707],"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.00001683544,0.00020546315,0.033895146,0.000060736038,0.00012660718,0.0000020416462,0.0007433376,0.01781881,0.00004820961,0.9306115,0.014668041,0.0018032605],"study_design_scores_gemma":[0.0005621465,0.000056924782,0.046372537,0.000020444935,0.000041614025,0.000021497131,0.000470582,0.003592883,0.00018821105,0.9468627,0.0016606965,0.00014973828],"about_ca_topic_score_codex":0.000018532437,"about_ca_topic_score_gemma":0.0000025639254,"teacher_disagreement_score":0.05936073,"about_ca_system_score_codex":0.000032370812,"about_ca_system_score_gemma":0.00013478631,"threshold_uncertainty_score":0.3287121},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010582849,0.00018599378,0.98620856,0.0019648476,0.00028292026,0.00037966613,0.0002101553,0.00007519795,0.000109822264],"genre_scores_gemma":[0.745335,0.0000116285455,0.25269082,0.0005926878,0.00035778113,0.00007060368,0.00017695191,0.00002140568,0.00074315805],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823624,0.00006724301,0.00043397894,0.00041885357,0.000536845,0.00030682658],"domain_scores_gemma":[0.99728876,0.001644386,0.00021645117,0.0003421202,0.0004168489,0.00009143404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004541245,0.00018975686,0.00021826844,0.00027109846,0.00022381116,0.00006872489,0.0006740898,0.00005992678,0.00007451813],"category_scores_gemma":[0.00012301382,0.00011753165,0.00021184751,0.000826602,0.000094761075,0.0004143981,0.00019871161,0.000066229004,0.00006617762],"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.00004516076,0.00018598087,0.00042406988,0.00002785211,0.00020188064,0.0000024577275,0.00017677461,0.050986663,0.0018031837,0.040701527,0.0041023553,0.9013421],"study_design_scores_gemma":[0.001244734,0.00017461649,0.007716948,0.000029422352,0.000019253534,0.000020283924,0.000010677697,0.9529905,0.0013964149,0.02834302,0.0078141475,0.00024002515],"about_ca_topic_score_codex":0.000008658999,"about_ca_topic_score_gemma":8.423476e-7,"teacher_disagreement_score":0.90200377,"about_ca_system_score_codex":0.00004512248,"about_ca_system_score_gemma":0.00014200521,"threshold_uncertainty_score":0.47928017},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.810866,0.0007164707,0.14921649,0.0016208047,0.00044637994,0.00080169964,0.00015531607,0.00021063499,0.03596622],"genre_scores_gemma":[0.96591574,0.000011922022,0.030952137,0.00036058543,0.0001024883,0.00007892377,0.00013842808,0.000028396502,0.0024113753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982236,0.00008632463,0.00048054004,0.00034324464,0.0004967592,0.0003695038],"domain_scores_gemma":[0.9977316,0.0014187782,0.00020879935,0.0002096152,0.00030638982,0.00012479929],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005464765,0.00022428713,0.00033806654,0.00033606074,0.00030468215,0.00058740296,0.00070772774,0.000068770816,0.0015521868],"category_scores_gemma":[0.0009954509,0.0001840157,0.000106306405,0.0010548779,0.000080752856,0.0009330401,0.00041067242,0.00024709082,0.0002844492],"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.000026814692,0.00014740342,0.003553385,0.0003262218,0.00015524079,0.000007482382,0.0012359195,0.0007553038,0.000015633863,0.9570385,0.025377154,0.011360946],"study_design_scores_gemma":[0.0004200927,0.00006339035,0.0058837077,0.00009440037,0.000018579245,0.000013148153,0.002600985,0.006055477,0.000056164525,0.9821819,0.0022698268,0.00034234533],"about_ca_topic_score_codex":0.00023677976,"about_ca_topic_score_gemma":0.000011239236,"teacher_disagreement_score":0.15504976,"about_ca_system_score_codex":0.00006212777,"about_ca_system_score_gemma":0.00007727251,"threshold_uncertainty_score":0.9993605},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13208733,0.00007985506,0.8657147,0.00038377193,0.00041827632,0.0008671438,0.00003014288,0.00019888619,0.00021987378],"genre_scores_gemma":[0.5458012,0.000001627125,0.45285657,0.0003221339,0.0001799101,0.00008988349,0.0007014701,0.000015741572,0.000031413823],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972407,0.00014272702,0.0006956627,0.00079345814,0.0006297086,0.0004977216],"domain_scores_gemma":[0.99816805,0.00050792604,0.0002280056,0.00036571344,0.0005227872,0.00020749624],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006146899,0.00030146676,0.00031193238,0.0008315352,0.00031589324,0.00052378315,0.0006917448,0.0001245437,0.000044401713],"category_scores_gemma":[0.00005848412,0.00031329846,0.00012736338,0.0018145056,0.000054522545,0.0017833121,0.0001366802,0.00019216456,0.00006967409],"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.000007617781,0.00037541284,0.0016299697,0.000031574906,0.000040741626,0.000006037712,0.00064029254,0.29591194,0.00042188,0.07107118,0.0005264877,0.62933683],"study_design_scores_gemma":[0.00081350975,0.00015552182,0.049730048,0.000022941875,0.0000058665755,0.000016536535,0.00007785936,0.8911189,0.00014652137,0.057317033,0.00023848568,0.00035681992],"about_ca_topic_score_codex":0.00005020796,"about_ca_topic_score_gemma":0.0000060957736,"teacher_disagreement_score":0.62898004,"about_ca_system_score_codex":0.00013033641,"about_ca_system_score_gemma":0.00015253626,"threshold_uncertainty_score":0.99993193},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1810915,0.00064089074,0.81454974,0.0026594792,0.00033301255,0.00012294546,0.000022920163,0.00014991625,0.00042958642],"genre_scores_gemma":[0.9378421,0.0000435062,0.060988337,0.00031036875,0.0002407824,0.000014052106,0.000042386746,0.000012489501,0.0005060238],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99810666,0.00008382575,0.00033922732,0.0005873601,0.0005797533,0.00030315164],"domain_scores_gemma":[0.99828506,0.0008563732,0.00014298123,0.0002585121,0.00026808275,0.00018901617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037893807,0.00021819607,0.00022219594,0.00078145065,0.00022502143,0.00025412583,0.00043677317,0.000074636984,0.000045522742],"category_scores_gemma":[0.00019131064,0.00016018176,0.00007907736,0.0018868409,0.00008669732,0.00089494005,0.0002982133,0.00008522502,0.00009346255],"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.000026115154,0.00012045866,0.014853738,0.000053511347,0.00014722026,0.00002408395,0.00022362947,0.0226317,0.0010730145,0.44131422,0.0021227058,0.5174096],"study_design_scores_gemma":[0.0027948257,0.0003802579,0.6055161,0.00013253669,0.00005120225,0.00018139354,0.000058256668,0.1687232,0.0014479049,0.19190624,0.027411694,0.0013963957],"about_ca_topic_score_codex":0.000009520391,"about_ca_topic_score_gemma":0.0000017491323,"teacher_disagreement_score":0.7567506,"about_ca_system_score_codex":0.000046630033,"about_ca_system_score_gemma":0.00010193621,"threshold_uncertainty_score":0.6532023},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7065804,0.00021867252,0.29137006,0.00009008819,0.00025501606,0.00034950374,0.00011912636,0.00007029578,0.0009468545],"genre_scores_gemma":[0.8505689,0.00000596102,0.14921468,0.000012628096,0.000027634702,0.00000469587,0.000060856168,0.000025001873,0.00007966248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858564,0.000075256066,0.0005462173,0.00017952822,0.00045904276,0.00015432105],"domain_scores_gemma":[0.99731845,0.0011210006,0.00042668698,0.00020942795,0.00081604475,0.00010840892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033977057,0.00015106595,0.00042172454,0.00019342602,0.000050035596,0.000014518258,0.00016173371,0.00007591092,0.00002087404],"category_scores_gemma":[0.0024196296,0.00014703302,0.00006165563,0.00065730914,0.0001594671,0.00012996809,0.00011528994,0.00009271428,0.0000036542317],"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.00007164582,0.00040807697,0.0100468015,0.00042428635,0.00016866114,0.0000023368557,0.002447804,0.003998358,0.00033340385,0.98078877,0.0008916046,0.00041828194],"study_design_scores_gemma":[0.0016589017,0.00015776909,0.0046672015,0.00010806678,0.000072381576,0.0000073764572,0.0007333983,0.023238733,0.0003375079,0.968701,0.00010811963,0.00020956714],"about_ca_topic_score_codex":0.000022256829,"about_ca_topic_score_gemma":0.000005568721,"teacher_disagreement_score":0.14398849,"about_ca_system_score_codex":0.000042254847,"about_ca_system_score_gemma":0.000109343964,"threshold_uncertainty_score":0.59958327},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92135656,0.00027672018,0.07476674,0.0000491041,0.0002705154,0.000366331,0.000018090528,0.0003554185,0.0025405188],"genre_scores_gemma":[0.9964009,0.0000022830232,0.0030178488,0.00007285178,0.000063241496,0.000072442126,0.00011079577,0.000037876438,0.00022175787],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989534,0.000049157523,0.00022796172,0.0002123318,0.0002849337,0.00027221008],"domain_scores_gemma":[0.9994433,0.00012520091,0.000040563373,0.00017567736,0.00009186721,0.00012341604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000100614765,0.00019870128,0.00019504224,0.00016327483,0.00008558911,0.00006813303,0.00013499853,0.0000639639,0.00025675693],"category_scores_gemma":[0.000011110804,0.00016360018,0.00006337983,0.00040952626,0.000052810425,0.0002476671,0.000021775513,0.00012230857,0.00028167755],"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.00006725161,0.000063431384,0.0094995955,0.0001921269,0.00026861086,0.000018617437,0.00074373296,0.96558505,0.006739779,0.005761889,0.008600367,0.002459543],"study_design_scores_gemma":[0.0024180412,0.00038272428,0.20599139,0.00030547855,0.00007262105,0.000064363194,0.00075650803,0.76410735,0.0024922208,0.020260543,0.0018264938,0.0013222805],"about_ca_topic_score_codex":0.00001243071,"about_ca_topic_score_gemma":0.0000010402532,"teacher_disagreement_score":0.20147772,"about_ca_system_score_codex":0.000027471506,"about_ca_system_score_gemma":0.000013960483,"threshold_uncertainty_score":0.66714215},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066867,0.00007270228,0.92746186,0.002374022,0.00017151577,0.00008054327,0.000002306154,0.00034048702,0.0026295516],"genre_scores_gemma":[0.72093534,0.0000015140715,0.2775156,0.0012845583,0.00007799036,0.000004803258,0.000021868704,0.000014073809,0.0001442413],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838966,0.00002915644,0.00019947941,0.00044666952,0.0006289641,0.00030604866],"domain_scores_gemma":[0.99928004,0.00011735434,0.000116659845,0.0002579419,0.000103749015,0.00012424322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023686652,0.00018947257,0.00017151205,0.00021369505,0.0002700262,0.00031267738,0.00061653595,0.000045590154,0.000021909751],"category_scores_gemma":[0.000042761538,0.00015603207,0.00006896237,0.0008068171,0.00005804997,0.0012121942,0.00020635675,0.00031284138,0.0001069698],"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.000010788195,0.000049914786,0.0014610703,0.000024652914,0.000049253635,0.000061980594,0.0015967041,0.8013075,0.000037482416,0.18270218,0.0000646519,0.012633822],"study_design_scores_gemma":[0.0027637088,0.00042356848,0.047719147,0.00024452384,0.000022247443,0.000381961,0.00018562099,0.8319869,0.0002932661,0.11051917,0.0043452783,0.0011146077],"about_ca_topic_score_codex":0.00013151995,"about_ca_topic_score_gemma":7.223324e-7,"teacher_disagreement_score":0.65406835,"about_ca_system_score_codex":0.000061392595,"about_ca_system_score_gemma":0.00011970725,"threshold_uncertainty_score":0.6362803},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02551192,0.00021937658,0.9684699,0.0032520988,0.00020683942,0.0010086315,0.00004077598,0.00026234603,0.0010280863],"genre_scores_gemma":[0.66701895,0.0000016511221,0.33037356,0.0014183994,0.00020856257,0.00012578888,0.0002602313,0.000013833068,0.00057902915],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978412,0.000049073715,0.00040711576,0.0007069008,0.0005922905,0.00040346265],"domain_scores_gemma":[0.9984358,0.00031469634,0.00015408582,0.00036255797,0.00048849307,0.00024435067],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033186201,0.00026614827,0.00026186596,0.00056347245,0.0004005538,0.00032032604,0.0005902108,0.00008549581,0.000035615096],"category_scores_gemma":[0.000037579714,0.00024802107,0.0001097967,0.0025483593,0.000029944216,0.0005212692,0.00007763031,0.0001269577,0.000063902226],"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.00006826661,0.00012390604,0.0001481485,0.00001600524,0.000062399486,0.0000038095716,0.00014213403,0.72487223,0.00066726503,0.211974,0.0014569798,0.060464866],"study_design_scores_gemma":[0.0048530726,0.0017109197,0.11270868,0.000110573,0.000102392805,0.000086982334,0.000068224625,0.64758056,0.002172842,0.09857552,0.1300059,0.0020243505],"about_ca_topic_score_codex":0.000004713599,"about_ca_topic_score_gemma":0.0000016093697,"teacher_disagreement_score":0.641507,"about_ca_system_score_codex":0.00009082623,"about_ca_system_score_gemma":0.00017441572,"threshold_uncertainty_score":0.9999972},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.995394,0.00008061604,0.0004987681,0.000105523635,0.002431565,0.00011369693,0.00031334732,0.000048464255,0.0010140464],"genre_scores_gemma":[0.9950795,6.322529e-7,0.004264128,0.00008824787,0.00040332903,0.0000015412043,0.00009666387,0.000016448237,0.00004947149],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986509,0.00003932509,0.00031397495,0.0002617809,0.0004945753,0.00023942182],"domain_scores_gemma":[0.99931777,0.00008384784,0.00016012407,0.00019226188,0.00015105441,0.000094940944],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000111513764,0.00016747217,0.00023257747,0.00010979597,0.00014932625,0.0000834321,0.0003229923,0.00011268118,0.0021594786],"category_scores_gemma":[0.00008655265,0.00013034507,0.000087684224,0.00025107551,0.0002431345,0.00019422614,0.000115732,0.00024196538,0.000027872138],"study_design_candidate":"bench_or_experimental","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.000115812974,0.000027646967,0.00217413,0.000045314722,0.000017879933,0.0000023188938,0.00023837495,0.0029694317,0.86496156,0.12831922,0.00018657568,0.0009417214],"study_design_scores_gemma":[0.0020451867,0.00037825198,0.101850756,0.000042759842,0.00004339343,0.00007090288,0.0001812509,0.0025078463,0.40511554,0.4829653,0.0040313555,0.00076747534],"about_ca_topic_score_codex":0.00009284025,"about_ca_topic_score_gemma":0.000009959077,"teacher_disagreement_score":0.45984605,"about_ca_system_score_codex":0.000011499689,"about_ca_system_score_gemma":0.00007642384,"threshold_uncertainty_score":0.99875265},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21119478,0.0004663304,0.78304213,0.004281785,0.00015342352,0.0003414125,0.000015945674,0.000101156395,0.00040303782],"genre_scores_gemma":[0.84445035,0.0000091703505,0.15442006,0.0007677544,0.00012286933,0.00002553836,0.00011056506,0.0000092166465,0.00008449764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824756,0.00005036693,0.00038193044,0.00059193483,0.00039097585,0.0003372088],"domain_scores_gemma":[0.99883944,0.00051829923,0.00014013212,0.00019994755,0.00017821147,0.00012395658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045227702,0.000218873,0.00024380186,0.0005380705,0.00020804946,0.00023843926,0.0003514511,0.0000816917,0.0000052114433],"category_scores_gemma":[0.00015989794,0.00022293298,0.00008827871,0.0012309625,0.00004405294,0.0006064174,0.000088923596,0.00009525359,0.000007829996],"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.0001239837,0.00020569623,0.0038683852,0.00005368,0.000041411244,0.000015443366,0.0010607287,0.11934691,0.000842902,0.70236415,0.0009631438,0.1711136],"study_design_scores_gemma":[0.0009930412,0.0002700901,0.11959618,0.00004199154,0.000008024052,0.000025299996,0.000031916014,0.53957635,0.00034786432,0.33724082,0.0015094791,0.000358932],"about_ca_topic_score_codex":0.000013653801,"about_ca_topic_score_gemma":0.000013435736,"teacher_disagreement_score":0.63325554,"about_ca_system_score_codex":0.000059519367,"about_ca_system_score_gemma":0.000088636305,"threshold_uncertainty_score":0.90909433},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9564932,0.000047485133,0.0019065792,0.002681663,0.00020149985,0.00018539577,0.000011558388,0.00012264177,0.038350005],"genre_scores_gemma":[0.99145,0.000009664048,0.00043495194,0.005749277,0.000162756,0.0000114947,0.00021752212,0.000016363447,0.0019479718],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9988182,0.000007890302,0.00024905565,0.0003274501,0.0003816448,0.00021571208],"domain_scores_gemma":[0.9996946,0.000036775953,0.000039586812,0.00014286513,0.00006434009,0.000021865259],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00018956524,0.00016735138,0.00013454366,0.00029034508,0.00019745757,0.0001927286,0.00014604333,0.000035798275,0.0051033725],"category_scores_gemma":[0.00003062106,0.00016300121,0.000056836376,0.00046812897,0.000054181517,0.0004866315,0.000068514266,0.00009381822,0.0018784734],"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.0003729128,0.000431564,0.0096522225,0.0005639575,0.00019548388,0.000023404902,0.00031702974,0.39824513,0.000028066557,0.3322888,0.060407948,0.19747347],"study_design_scores_gemma":[0.0015860297,0.000056582907,0.328896,0.00007933268,0.00006761342,0.000002929654,0.00042680593,0.2856353,0.0000028149134,0.17940634,0.20296857,0.0008716852],"about_ca_topic_score_codex":0.00026352252,"about_ca_topic_score_gemma":0.000017938735,"teacher_disagreement_score":0.31924376,"about_ca_system_score_codex":0.000019003635,"about_ca_system_score_gemma":0.000008017807,"threshold_uncertainty_score":0.9988987},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056130216,0.00022395013,0.93995786,0.0007287037,0.00073133496,0.0003576302,0.000018066425,0.00020221877,0.0016499948],"genre_scores_gemma":[0.7492218,0.000002896231,0.24896002,0.0010553563,0.00030807097,0.000022052736,0.00014311571,0.000014081064,0.0002725882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977082,0.000042694293,0.0005014407,0.0005975704,0.00068142504,0.0004686881],"domain_scores_gemma":[0.9975867,0.0012179246,0.00018936173,0.0003258276,0.00048435913,0.00019578909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013470809,0.0002285846,0.00021071822,0.0005558614,0.00035467578,0.00022018525,0.00073305453,0.00009408936,0.000031262305],"category_scores_gemma":[0.00023964449,0.00022763254,0.00017095038,0.0014640565,0.000072353985,0.00073406176,0.00019255461,0.00014134661,0.00007805355],"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.000049594302,0.00007973391,0.00085085817,0.000027287571,0.000047019996,0.0000112039515,0.00027362877,0.12280946,0.0005704392,0.81657845,0.0021859074,0.056516394],"study_design_scores_gemma":[0.0011713145,0.00026896448,0.060011655,0.00002959685,0.000016394531,0.00009733663,0.00005702843,0.49186486,0.0023683826,0.42938852,0.014020091,0.0007058437],"about_ca_topic_score_codex":0.0000063186803,"about_ca_topic_score_gemma":0.0000045868587,"teacher_disagreement_score":0.69309163,"about_ca_system_score_codex":0.00008265236,"about_ca_system_score_gemma":0.00014993905,"threshold_uncertainty_score":0.9282586},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65276355,0.0018790246,0.34281164,0.000058187474,0.00026549754,0.000049108286,0.000009194447,0.00013008417,0.002033704],"genre_scores_gemma":[0.9687053,0.000025324991,0.030785635,0.00014367161,0.00019036475,0.0000029445578,0.000091910915,0.00001598698,0.00003885569],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935573,0.00001262174,0.00015781487,0.000104503575,0.00016974533,0.0001995581],"domain_scores_gemma":[0.99966514,0.00009714774,0.000025468893,0.00006250392,0.000033712255,0.00011602919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006259179,0.00011589428,0.00013724006,0.00008371866,0.00006490218,0.000047495312,0.000051760733,0.00011138015,0.00030400857],"category_scores_gemma":[0.000029274233,0.0001037577,0.000047357444,0.00037930522,0.000036502326,0.00018860004,0.000027570155,0.00020059894,0.000025407753],"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.0000047882054,0.0000114652075,0.080713026,0.000033830507,0.0001339564,0.0000011273622,0.0001887428,0.8938051,0.00005698254,0.011498134,0.0009582757,0.012594559],"study_design_scores_gemma":[0.00017013718,0.0000118538055,0.31342852,0.000014604528,0.000037687085,0.000013980174,0.000099459285,0.6826023,0.000058887752,0.0023323419,0.0009890245,0.00024120357],"about_ca_topic_score_codex":0.0000038180588,"about_ca_topic_score_gemma":2.1546087e-7,"teacher_disagreement_score":0.31594175,"about_ca_system_score_codex":0.000024045816,"about_ca_system_score_gemma":0.000003551262,"threshold_uncertainty_score":0.42311162},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37560663,0.00015746125,0.6173787,0.0033293678,0.00020857328,0.00022530174,0.00004146365,0.00005017851,0.0030023044],"genre_scores_gemma":[0.9722078,0.00000415223,0.02667417,0.0008802479,0.0000650642,0.000004266724,0.00008047762,0.0000065584018,0.000077298835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997856,0.00013712386,0.00054494845,0.00036782929,0.0008588237,0.00023526007],"domain_scores_gemma":[0.99798566,0.00082862796,0.0003409657,0.00042655077,0.00033636426,0.000081805316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049138785,0.00020253539,0.000294994,0.00039954865,0.00016418388,0.00006486836,0.00081716664,0.00005976779,0.0000935115],"category_scores_gemma":[0.00016403236,0.00015515466,0.00018588277,0.0014469519,0.00019059557,0.00027763052,0.00011692469,0.00015797635,0.000023543842],"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.00003685503,0.00015356396,0.00022307856,0.000015839969,0.00004213667,0.000002378953,0.00021049235,0.104628585,0.00090604235,0.8774599,0.000875958,0.015445155],"study_design_scores_gemma":[0.0005435193,0.0005624327,0.15991983,0.00006022058,0.000015039752,0.000016102338,0.00004862061,0.18561979,0.007266481,0.64536947,0.00028905983,0.0002894309],"about_ca_topic_score_codex":0.000016286589,"about_ca_topic_score_gemma":0.000001451432,"teacher_disagreement_score":0.5966011,"about_ca_system_score_codex":0.00003149433,"about_ca_system_score_gemma":0.00011974562,"threshold_uncertainty_score":0.63270235},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9626145,0.00044146224,0.016205586,0.000022867363,0.0001310645,0.000116929805,0.000043034877,0.00035969092,0.02006489],"genre_scores_gemma":[0.9986862,0.000007879716,0.000719121,0.00005175362,0.00009372626,0.000017356846,0.00008620417,0.00003458473,0.00030320842],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990942,0.000025623416,0.00019319436,0.00017865827,0.00027465378,0.00023366543],"domain_scores_gemma":[0.99963063,0.00009561069,0.000020451194,0.00013996435,0.000031395884,0.000081930884],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00008687424,0.00017271053,0.00016473973,0.00014516871,0.0001008004,0.0000694191,0.00013586308,0.000047769587,0.0009394346],"category_scores_gemma":[0.0000040992218,0.00015300629,0.00006324102,0.00043375025,0.000050170736,0.00018355764,0.000009243374,0.00011814442,0.00022578199],"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.000032155524,0.000011423161,0.002560718,0.000062903884,0.00007379562,0.000013238605,0.00021149947,0.98575896,0.000047798272,0.004935702,0.00034782322,0.005944006],"study_design_scores_gemma":[0.0036560446,0.0006354315,0.29254505,0.00069102773,0.00013021127,0.00035024717,0.0016338363,0.59664106,0.0012831662,0.035336986,0.06428164,0.0028153132],"about_ca_topic_score_codex":0.000011379944,"about_ca_topic_score_gemma":0.0000033691833,"teacher_disagreement_score":0.3891179,"about_ca_system_score_codex":0.000025032024,"about_ca_system_score_gemma":0.000011275404,"threshold_uncertainty_score":0.99997383},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80317885,0.00076547614,0.19462834,0.00015451132,0.000051327504,0.0000890053,0.000030642805,0.00012874359,0.00097312825],"genre_scores_gemma":[0.99238414,0.00007706403,0.0070851548,0.00009692518,0.00006172875,0.0000049409928,0.00021417656,0.000023536835,0.00005234462],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913067,0.000018498431,0.00017453847,0.00021914241,0.00025859906,0.00019853354],"domain_scores_gemma":[0.9996694,0.00006342715,0.000032811047,0.000080371916,0.00006590763,0.00008812403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004791761,0.00018461289,0.0001986646,0.00021998106,0.00010363166,0.00007946966,0.0000712557,0.00005766542,0.000104919265],"category_scores_gemma":[0.000008723138,0.00014919814,0.0000503974,0.0007042605,0.00005968722,0.00022970578,0.000015543443,0.00011320003,0.0000092012415],"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.00002717532,0.000006460006,0.0114910025,0.000021920157,0.00017927769,0.000016381198,0.00028881922,0.98019105,0.0001654721,0.0009346605,0.000044836008,0.0066329697],"study_design_scores_gemma":[0.00051981496,0.00007190638,0.24858624,0.000036156285,0.00007613359,0.00008287226,0.00044920066,0.7480805,0.00023452657,0.0012015861,0.00027440212,0.000386644],"about_ca_topic_score_codex":0.000030892614,"about_ca_topic_score_gemma":0.000008368505,"teacher_disagreement_score":0.23709524,"about_ca_system_score_codex":0.000031837328,"about_ca_system_score_gemma":0.000009326755,"threshold_uncertainty_score":0.6084123},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.884728,0.0012477733,0.10532826,0.00024536857,0.0004829308,0.00015953858,0.00006277813,0.00007923815,0.0076660705],"genre_scores_gemma":[0.97130704,0.000006268581,0.027748872,0.00013567238,0.00019987539,0.000006757082,0.00004770592,0.000022111402,0.00052572234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998432,0.00006753881,0.00044341135,0.00017667282,0.0004789504,0.0004014439],"domain_scores_gemma":[0.9978411,0.0013673138,0.00023028784,0.00019833879,0.00022019418,0.00014274719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051054946,0.00017061848,0.00034878874,0.00062045763,0.000084329535,0.000012574676,0.00021416847,0.000103919825,0.00071139366],"category_scores_gemma":[0.0012455167,0.00015342915,0.00014623223,0.0013266761,0.00018660966,0.00020591587,0.0001349268,0.00014261069,0.000091817565],"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.00002147542,0.0002409266,0.04863746,0.000121507954,0.00016311031,0.000001980715,0.0005359419,0.00021817742,0.000053696385,0.9434751,0.0035772794,0.0029533375],"study_design_scores_gemma":[0.0013098144,0.00026778408,0.25170818,0.00005365056,0.000159163,0.00006913343,0.001595416,0.00070624123,0.0012221164,0.73730963,0.0049594888,0.0006393852],"about_ca_topic_score_codex":0.000014661632,"about_ca_topic_score_gemma":3.9159764e-7,"teacher_disagreement_score":0.20616548,"about_ca_system_score_codex":0.000035522058,"about_ca_system_score_gemma":0.000047017,"threshold_uncertainty_score":0.77892613},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52339506,0.00004883065,0.47526088,0.00018139754,0.000081791964,0.00009420801,0.000025081412,0.000028394634,0.000884313],"genre_scores_gemma":[0.84144115,0.0000050790813,0.15821858,0.00009591507,0.000051428306,0.00000387138,0.00008657408,0.000009096873,0.00008831836],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981338,0.00007321648,0.00044906093,0.0003539409,0.0007782718,0.00021170531],"domain_scores_gemma":[0.9985867,0.0003209716,0.0002981573,0.00024786041,0.00044594705,0.00010036565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002091179,0.0001753954,0.0002939269,0.00036317605,0.00010438435,0.000023032037,0.0003897632,0.000056452292,0.000064863074],"category_scores_gemma":[0.000046730253,0.00016113426,0.00011831185,0.0015997345,0.00015536847,0.0004359826,0.0001077916,0.00010810363,0.000019844],"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.00049214374,0.00078286964,0.068296604,0.00051704503,0.00070592784,0.00016063113,0.013093231,0.65880734,0.0018362942,0.23846395,0.0019414533,0.014902495],"study_design_scores_gemma":[0.0045016618,0.00086758315,0.38071138,0.0002823829,0.000076674114,0.0014855126,0.00042284714,0.55791146,0.006277516,0.045041632,0.0013164869,0.0011048843],"about_ca_topic_score_codex":0.000019151592,"about_ca_topic_score_gemma":0.0000014895396,"teacher_disagreement_score":0.31804603,"about_ca_system_score_codex":0.00003124532,"about_ca_system_score_gemma":0.0002541782,"threshold_uncertainty_score":0.65708643},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96862173,0.0001640048,0.011418032,0.00011536517,0.00006711152,0.00025811343,0.00034578305,0.000053992433,0.018955851],"genre_scores_gemma":[0.974585,0.000013510832,0.022763183,0.000022714501,0.000048205984,0.0000048190827,0.0003774835,0.000029192974,0.0021559014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984615,0.00011938219,0.00045798343,0.0001827766,0.0005948508,0.00018352112],"domain_scores_gemma":[0.9984038,0.00073013414,0.00013295209,0.00029319315,0.00037158318,0.000068365305],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004411258,0.0001139863,0.00025880433,0.00025036992,0.00005581344,0.000011142812,0.00025008866,0.00007480318,0.0026185345],"category_scores_gemma":[0.0004019067,0.00011164455,0.00009540861,0.00096595177,0.00017727642,0.00009402724,0.0000535666,0.00010910535,0.000055538647],"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.00026968948,0.00034689571,0.0032615059,0.00039679167,0.00019633063,0.000006803148,0.0007719046,0.027494282,0.00060419197,0.95256984,0.007056979,0.0070247604],"study_design_scores_gemma":[0.0007343356,0.00026555217,0.008989705,0.00010920322,0.000045842407,0.000014875932,0.00021323554,0.011639273,0.0007982556,0.97411263,0.0028363299,0.00024077286],"about_ca_topic_score_codex":0.000020940584,"about_ca_topic_score_gemma":0.0000019840572,"teacher_disagreement_score":0.021542752,"about_ca_system_score_codex":0.000028804623,"about_ca_system_score_gemma":0.000075625765,"threshold_uncertainty_score":0.9982932},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91104174,0.00066742493,0.0865386,0.000065932276,0.00070358725,0.00033616426,0.00027490608,0.000033672186,0.00033796486],"genre_scores_gemma":[0.99409807,0.0000071796494,0.005608432,0.000030488507,0.00006629599,0.00002385558,0.00010444797,0.000008609177,0.00005262138],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99894017,0.00007409042,0.00030911373,0.00021941119,0.00028229423,0.00017489208],"domain_scores_gemma":[0.9993338,0.00016476857,0.00019206169,0.00009506813,0.00016433217,0.000049991555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002783814,0.00011965397,0.00019086977,0.00008753123,0.00015118635,0.000075172204,0.00009718823,0.000057830515,0.0001845916],"category_scores_gemma":[0.00014794266,0.00009436596,0.000073891904,0.00016018329,0.00017861747,0.00020761634,0.000011654196,0.000046345103,0.000010493812],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016646217,0.00005232422,0.0013212251,0.00032578385,0.000036862002,0.0000030197791,0.00028460548,0.18185534,0.58940643,0.22592388,0.00033393124,0.00029015722],"study_design_scores_gemma":[0.0036399611,0.0011023383,0.039417583,0.00042690785,0.00016823353,0.0003513205,0.0033474944,0.032415517,0.7061923,0.19700256,0.0144451605,0.0014905842],"about_ca_topic_score_codex":0.00008357941,"about_ca_topic_score_gemma":0.0000049442574,"teacher_disagreement_score":0.14943981,"about_ca_system_score_codex":0.00004499873,"about_ca_system_score_gemma":0.0000677633,"threshold_uncertainty_score":0.38481325},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012113289,0.00008192582,0.9838738,0.000657756,0.00013005805,0.00063886016,0.0001297308,0.0001615294,0.0022130795],"genre_scores_gemma":[0.19031923,0.000002545481,0.806225,0.00015389848,0.00016650264,0.00012187499,0.00044269103,0.000052921747,0.0025153293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983648,0.000048843784,0.00039353067,0.00031131113,0.0005305164,0.0003510009],"domain_scores_gemma":[0.99758726,0.0010795356,0.00014147391,0.00023070915,0.00071913155,0.00024185741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038321712,0.00017724845,0.00023095937,0.0003585423,0.00018800578,0.00007942685,0.00023982082,0.00007789257,0.00008326736],"category_scores_gemma":[0.0016435115,0.00017130021,0.00011729699,0.0006467555,0.00007141436,0.00025087822,0.00010130128,0.00013232222,0.000049659615],"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.00014973932,0.0003083265,0.00068787526,0.00010815432,0.00015896434,0.0000057551392,0.00066729356,0.46176928,0.000029052615,0.51198226,0.0057766335,0.018356668],"study_design_scores_gemma":[0.0012502117,0.00009054632,0.0013785101,0.000014733765,0.000019021387,0.000009642491,0.00021067091,0.3686664,0.00006001813,0.6254678,0.0026065237,0.00022594728],"about_ca_topic_score_codex":0.0000053806866,"about_ca_topic_score_gemma":0.0000053785443,"teacher_disagreement_score":0.17820594,"about_ca_system_score_codex":0.00011980547,"about_ca_system_score_gemma":0.00017265683,"threshold_uncertainty_score":0.698542},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7129349,0.000004116394,0.2842306,0.0011265511,0.000051379553,0.00043510206,0.00010218661,0.000048414848,0.0010667882],"genre_scores_gemma":[0.9807337,0.0000022927372,0.018324278,0.00039604536,0.00005863002,0.000017131451,0.0002778039,0.000015712978,0.00017439609],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989475,0.000027722397,0.00038202258,0.00016783168,0.00032984806,0.00014509399],"domain_scores_gemma":[0.9980516,0.0013346854,0.00022945167,0.00017565407,0.00016872156,0.000039911178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035662262,0.00013148079,0.0002182862,0.000108746855,0.00009165963,0.000028837529,0.00014998749,0.00005960529,0.00010902913],"category_scores_gemma":[0.00040594826,0.0000893354,0.00011884193,0.00024286598,0.000019975076,0.00006526376,0.000020253146,0.00008086863,0.000011713056],"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.000040006504,0.00024173193,0.000012259631,0.00009628507,0.000029757039,4.0736344e-7,0.00020798948,0.00043698828,0.0025739158,0.99399287,0.0002993312,0.0020684728],"study_design_scores_gemma":[0.00028256612,0.00017515119,0.0022079318,0.00007183125,0.000025279443,0.0000015382361,0.000023421566,0.15532339,0.000439227,0.8411749,0.00016158682,0.00011315284],"about_ca_topic_score_codex":3.7778423e-7,"about_ca_topic_score_gemma":1.05143386e-7,"teacher_disagreement_score":0.2677988,"about_ca_system_score_codex":0.000020122683,"about_ca_system_score_gemma":0.000021878119,"threshold_uncertainty_score":0.3642992},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09772447,0.0001364587,0.89924115,0.000954901,0.00038838564,0.0005074906,0.00005799417,0.000098841556,0.00089031574],"genre_scores_gemma":[0.86603934,0.0000052158957,0.13263424,0.00026803155,0.00026208887,0.00006240616,0.0005022358,0.00001316919,0.00021329639],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807155,0.000068279616,0.0006263599,0.00043920122,0.00052235916,0.00027224675],"domain_scores_gemma":[0.9980837,0.00066226086,0.00031748106,0.00027147992,0.0005588109,0.00010625573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040891318,0.00019615638,0.00029494867,0.000578649,0.0002441299,0.00011614487,0.00044889978,0.00009113154,0.000056045843],"category_scores_gemma":[0.00021392343,0.00020470115,0.00019661797,0.0015030175,0.000066090804,0.0006283848,0.00010284049,0.00008205815,0.000019338791],"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.00011227724,0.00023379693,0.001200652,0.000067831235,0.00010647586,0.0000024368237,0.0004779076,0.4309294,0.001454568,0.49419594,0.0016696265,0.0695491],"study_design_scores_gemma":[0.0012551368,0.00017757792,0.022044102,0.0000186681,0.000023537463,0.000021976984,0.000054076132,0.88784647,0.0008578839,0.084147826,0.0032662195,0.00028649898],"about_ca_topic_score_codex":0.000009269034,"about_ca_topic_score_gemma":0.0000024511887,"teacher_disagreement_score":0.76831484,"about_ca_system_score_codex":0.00004650402,"about_ca_system_score_gemma":0.0001737282,"threshold_uncertainty_score":0.8347471},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45583996,0.00012440518,0.54152006,0.000029687733,0.0001809341,0.000053425843,0.000010651139,0.0001070668,0.0021337937],"genre_scores_gemma":[0.90690047,0.0000028007798,0.0924642,0.00014255285,0.0002121302,0.0000018860726,0.00022039285,0.000023238661,0.000032347238],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881625,0.000009284394,0.0003911035,0.00020274479,0.00028768345,0.00029296015],"domain_scores_gemma":[0.9994201,0.0002013734,0.00006801221,0.00009587134,0.000115521885,0.000099109355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019779628,0.0001810492,0.00019881708,0.00022567599,0.00024006816,0.00023108876,0.00010908292,0.00015617318,0.0002086553],"category_scores_gemma":[0.000051994924,0.00017530094,0.00010759858,0.0006589919,0.00008653662,0.00018441984,0.000024081626,0.00030400054,0.000024650173],"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.000006817033,0.000004579693,0.002476398,0.000019297935,0.00007018537,0.000007862435,0.00021130398,0.97931087,0.0006969189,0.00063765096,0.00008768279,0.016470436],"study_design_scores_gemma":[0.0002637347,0.000016173186,0.06419429,0.000038789723,0.00002418897,0.0000126495615,0.00016071515,0.9332182,0.00048222495,0.0011814598,0.00013938363,0.00026822454],"about_ca_topic_score_codex":0.000007692269,"about_ca_topic_score_gemma":0.0000043358787,"teacher_disagreement_score":0.4510605,"about_ca_system_score_codex":0.000056389024,"about_ca_system_score_gemma":0.000025469635,"threshold_uncertainty_score":0.7148565},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34671363,0.00020617762,0.649609,0.0022122324,0.00053376186,0.00026882775,0.000013300288,0.000094367555,0.00034867288],"genre_scores_gemma":[0.8004864,0.000001343604,0.19775176,0.0011256263,0.00031089206,0.000016783943,0.000098553624,0.000015304535,0.00019337957],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971504,0.00006564245,0.00061176927,0.0006870688,0.00097268063,0.00051242404],"domain_scores_gemma":[0.9982348,0.00069116073,0.00014146093,0.00030933638,0.00033138474,0.00029184335],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011642523,0.000272436,0.0002796589,0.0013005921,0.00017880752,0.00016426107,0.00058370654,0.000098188466,0.000054782733],"category_scores_gemma":[0.00022995559,0.00027511365,0.00013139442,0.003128594,0.00003703064,0.0004682919,0.0003193169,0.00020171888,0.0001864572],"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.00008198932,0.00014736966,0.0044238335,0.00001509114,0.00003341526,0.00009198392,0.00020693045,0.88670135,0.00034771572,0.06780082,0.001170666,0.038978852],"study_design_scores_gemma":[0.0014328236,0.0002540374,0.4324212,0.000073242874,0.000010266517,0.000086110245,0.0000394955,0.5183375,0.00074101554,0.03994992,0.0059391162,0.00071527594],"about_ca_topic_score_codex":0.000056839952,"about_ca_topic_score_gemma":0.00025476492,"teacher_disagreement_score":0.45377272,"about_ca_system_score_codex":0.0001509602,"about_ca_system_score_gemma":0.00018253064,"threshold_uncertainty_score":0.9999701},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.075802974,0.00018068118,0.9128132,0.007148896,0.00012539835,0.0008677697,0.00011881326,0.00012265776,0.0028196464],"genre_scores_gemma":[0.7694578,0.0000055947175,0.22883256,0.00027449412,0.00021751653,0.00018958023,0.00007894418,0.000037404447,0.0009060898],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889416,0.000016864431,0.00032532617,0.00021330822,0.0003043108,0.00024604224],"domain_scores_gemma":[0.997929,0.0014712459,0.00014082163,0.00025214016,0.00012674519,0.000080051286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024388665,0.0001549774,0.0001858306,0.000039418934,0.00045401134,0.00011399163,0.00028008607,0.00006392962,0.000055245106],"category_scores_gemma":[0.00031481322,0.00010347665,0.00014845374,0.0002955079,0.000100615,0.000049468716,0.00006189523,0.00011601405,0.00003848782],"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.000013880435,0.000095297466,0.000049463757,0.00006150777,0.000071611656,8.9369456e-7,0.00020733233,0.0054028444,0.00004370216,0.9837234,0.008636406,0.0016936706],"study_design_scores_gemma":[0.00054875546,0.000045145123,0.00051933626,0.000021612974,0.000030688243,0.000013418445,0.00020728873,0.004241948,0.00010973763,0.9741628,0.019930746,0.00016851726],"about_ca_topic_score_codex":0.000007189395,"about_ca_topic_score_gemma":0.000008632987,"teacher_disagreement_score":0.69365484,"about_ca_system_score_codex":0.00004246957,"about_ca_system_score_gemma":0.00008276172,"threshold_uncertainty_score":0.42196554},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6458119,0.00031208384,0.3507937,0.00077696686,0.0007649471,0.00030144886,0.00011358675,0.00018530746,0.00094004784],"genre_scores_gemma":[0.8252449,0.000017376004,0.17355329,0.00074424525,0.00006200237,0.000019461126,0.00017152354,0.000024264948,0.00016291917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975525,0.00008683395,0.00061233784,0.000711285,0.0006442602,0.0003927862],"domain_scores_gemma":[0.998408,0.00031515327,0.00031720876,0.00043179342,0.00028795114,0.00023984897],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00049120537,0.00034870236,0.00038434536,0.0010045089,0.0002898431,0.00021219329,0.000708651,0.00015972146,0.000047103567],"category_scores_gemma":[0.00007008442,0.0003433358,0.00019484852,0.0016294168,0.00024916814,0.0006436804,0.00018141435,0.00035451842,0.000018098139],"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.00005520098,0.00011416044,0.015905682,0.000064173444,0.00013638315,0.000014049541,0.0005231761,0.0112156635,0.0018670706,0.9628653,0.00078064686,0.0064584776],"study_design_scores_gemma":[0.0017047424,0.0004246402,0.16644086,0.00006369123,0.00005567103,0.00032995682,0.0001019249,0.06387415,0.0008550401,0.7558579,0.009259636,0.00103182],"about_ca_topic_score_codex":0.0000891164,"about_ca_topic_score_gemma":0.000056080473,"teacher_disagreement_score":0.20700745,"about_ca_system_score_codex":0.000012705104,"about_ca_system_score_gemma":0.00013839212,"threshold_uncertainty_score":0.9999019},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026608286,0.0006960067,0.96881974,0.00070095283,0.0008062808,0.000258255,0.00003783391,0.0003904123,0.0016822125],"genre_scores_gemma":[0.6222526,0.000005254102,0.37556165,0.00036649348,0.0003497509,0.000027182283,0.00038685734,0.000019533258,0.0010306697],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968008,0.00010973398,0.0006389147,0.0008463837,0.0010596727,0.00054450566],"domain_scores_gemma":[0.9982723,0.00041185765,0.00024060695,0.00044480368,0.00044952024,0.00018093157],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004787654,0.00034745547,0.000309568,0.0014658974,0.00040601785,0.0004444686,0.00089607097,0.00012580688,0.00009458861],"category_scores_gemma":[0.00009606362,0.00035594663,0.00021739297,0.004807756,0.00007816735,0.00095417775,0.0003243939,0.00024262107,0.0003942313],"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.00001100181,0.0004272768,0.0032248173,0.000030565017,0.00007293951,0.000047624955,0.00006717235,0.83890796,0.00044764805,0.104733884,0.005849234,0.046179887],"study_design_scores_gemma":[0.001012148,0.00008317483,0.20902526,0.0000132663035,0.000013938272,0.00006779417,0.000013745809,0.76052934,0.0003606658,0.021261334,0.0070770006,0.00054230925],"about_ca_topic_score_codex":0.000088087865,"about_ca_topic_score_gemma":0.0000066399025,"teacher_disagreement_score":0.5956443,"about_ca_system_score_codex":0.00013117226,"about_ca_system_score_gemma":0.00017895953,"threshold_uncertainty_score":0.99988925},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6447008,0.00092504686,0.30774906,0.0010624002,0.00040167157,0.0005075805,0.0001844419,0.00023592789,0.04423302],"genre_scores_gemma":[0.9892346,0.0000227027,0.008306799,0.00025080456,0.00021328514,0.000014597961,0.00006659701,0.000024050125,0.0018665418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99830645,0.000043352957,0.00044737503,0.0003274065,0.00051964866,0.00035574927],"domain_scores_gemma":[0.99749666,0.0019234741,0.00016694189,0.00015054391,0.00013865656,0.00012372393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076791743,0.00021712792,0.00029728562,0.00064901065,0.00031556474,0.00011414936,0.00013563198,0.00007941179,0.000078148485],"category_scores_gemma":[0.0006572424,0.00017782296,0.000094125564,0.0010902483,0.00012639842,0.00020583041,0.000051765255,0.00019302928,0.00001664474],"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.00037073527,0.00021915558,0.0043952106,0.0003528865,0.0001681999,0.00002424908,0.0011859224,0.00051833753,0.000012081583,0.9808946,0.0023465129,0.009512055],"study_design_scores_gemma":[0.0032472846,0.00045171683,0.051517244,0.00021903413,0.000104925486,0.000063846564,0.004307782,0.0020031973,0.00029443577,0.92664844,0.010260884,0.0008812181],"about_ca_topic_score_codex":0.00005656069,"about_ca_topic_score_gemma":0.00004953582,"teacher_disagreement_score":0.34453377,"about_ca_system_score_codex":0.000047846253,"about_ca_system_score_gemma":0.000052588857,"threshold_uncertainty_score":0.725141},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4292167,0.0006616969,0.5676159,0.0005152534,0.000519087,0.00010795335,0.000017538236,0.00015851122,0.001187328],"genre_scores_gemma":[0.9210882,0.0000013664336,0.07821077,0.00044173858,0.0000729363,0.000004634582,0.000053945783,0.000011313834,0.00011508115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812686,0.00007962315,0.00035619087,0.00039941422,0.0008009296,0.00023700518],"domain_scores_gemma":[0.9986807,0.00025277253,0.00017746685,0.00039630348,0.00030073736,0.00019203273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005709352,0.0001640813,0.00024235282,0.00030102665,0.00007248554,0.000053559204,0.00058923545,0.00006412756,0.000032531752],"category_scores_gemma":[0.00012826323,0.00014597712,0.000110511064,0.00084381254,0.000101265316,0.00039778673,0.00037552844,0.00012361057,0.000094095754],"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.00014839598,0.00056048983,0.0040892726,0.00007987982,0.00016337693,0.0001122417,0.0020842815,0.2708214,0.0019149148,0.6422879,0.020966632,0.056771204],"study_design_scores_gemma":[0.0011980475,0.0002228829,0.039776232,0.00008266731,0.000013273602,0.00010289353,0.00014247379,0.7733721,0.00056906976,0.18266118,0.0014473875,0.00041177444],"about_ca_topic_score_codex":0.000025027437,"about_ca_topic_score_gemma":4.2094e-7,"teacher_disagreement_score":0.5025507,"about_ca_system_score_codex":0.000043683598,"about_ca_system_score_gemma":0.00017719423,"threshold_uncertainty_score":0.5952774},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1982862,0.001042483,0.786169,0.003139937,0.00060793327,0.00046270894,0.000029195475,0.000059500642,0.010203071],"genre_scores_gemma":[0.97870743,0.000013590467,0.020626012,0.00043165963,0.00004613607,0.000016112266,0.00008510997,0.0000057506227,0.00006818264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99791884,0.00035396087,0.00043833285,0.0002971543,0.0007236664,0.00026801863],"domain_scores_gemma":[0.99801517,0.0012552346,0.00016777738,0.00036568017,0.00014554865,0.00005056833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011686602,0.00015332631,0.00016964595,0.00020925657,0.00032026213,0.00015308458,0.0008621722,0.000045175584,0.000016384238],"category_scores_gemma":[0.00020686137,0.00009849067,0.00008363545,0.0015240513,0.00023390455,0.00022755521,0.00007912269,0.00019400958,0.000025811452],"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.000011664406,0.00007826786,0.0025411497,0.00001013228,0.000020588845,0.0000066395082,0.00033442507,0.08783851,0.000035623754,0.9022554,0.0005515143,0.006316063],"study_design_scores_gemma":[0.0011575453,0.0002084498,0.3961146,0.000028921188,0.000014487737,0.00022259603,0.000444549,0.17757536,0.00045265435,0.40554437,0.017810713,0.00042573398],"about_ca_topic_score_codex":0.000025795563,"about_ca_topic_score_gemma":0.00004520747,"teacher_disagreement_score":0.78042126,"about_ca_system_score_codex":0.000029617655,"about_ca_system_score_gemma":0.00013794603,"threshold_uncertainty_score":0.4016333},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33610982,0.00036563224,0.6616841,0.00020430621,0.00015646165,0.00038522432,0.000021177517,0.0001827726,0.00089050207],"genre_scores_gemma":[0.9186531,0.000017826027,0.08060777,0.0001920366,0.00019706551,0.00001949065,0.000087802415,0.00006360284,0.00016135734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99814296,0.0000883935,0.00040268496,0.0003795921,0.0006558087,0.00033057193],"domain_scores_gemma":[0.99640167,0.0026012885,0.00026766074,0.00033334925,0.00016813706,0.0002279064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003710786,0.00029009266,0.00044690853,0.00026185223,0.00014256421,0.00008732684,0.00024235624,0.000076697026,0.000056415527],"category_scores_gemma":[0.0014906038,0.00024366721,0.000071854265,0.001051372,0.00008357493,0.00023550107,0.00013730791,0.00017691009,0.00002657089],"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.000026120608,0.00016106447,0.013758361,0.00092619675,0.0001240088,0.000008350495,0.00023833857,0.0023468987,0.000009706176,0.96940655,0.004215802,0.00877858],"study_design_scores_gemma":[0.001052187,0.00022434581,0.010088403,0.00021457461,0.000084500294,0.000026074467,0.00007202991,0.007157767,0.00004181594,0.9792977,0.0013548229,0.0003857744],"about_ca_topic_score_codex":0.000032315726,"about_ca_topic_score_gemma":0.000014193491,"teacher_disagreement_score":0.5825432,"about_ca_system_score_codex":0.00004788222,"about_ca_system_score_gemma":0.00006622687,"threshold_uncertainty_score":0.9936461},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026783662,0.000116762,0.9555714,0.00027985303,0.00033276022,0.000069816895,0.00003398235,0.00021506894,0.016596654],"genre_scores_gemma":[0.8970618,0.000004388724,0.10140992,0.0005480779,0.00006160373,0.000008138724,0.000078403704,0.000006867339,0.00082079973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9981822,0.00006633559,0.00035561272,0.00053630106,0.0005179561,0.00034159666],"domain_scores_gemma":[0.99893093,0.00014769357,0.00012356776,0.00043083762,0.00017707037,0.00018989242],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00026513386,0.00018678054,0.00024359576,0.0006435514,0.00014617459,0.0000907358,0.001111986,0.00006902447,0.0013598532],"category_scores_gemma":[0.00013457602,0.00015065723,0.00018861,0.0032096766,0.00012004744,0.0005941423,0.00059604296,0.00016628328,0.00043724134],"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.000040611045,0.00046791608,0.02995574,0.000018287255,0.00032718983,0.00013242074,0.00087309186,0.0020892369,0.000012740805,0.8855153,0.007743879,0.07282361],"study_design_scores_gemma":[0.0010964249,0.000626273,0.56409514,0.000027334267,0.00007257512,0.00009092901,0.00023960877,0.23446779,0.00016602715,0.17853306,0.01955287,0.0010319412],"about_ca_topic_score_codex":0.000105730905,"about_ca_topic_score_gemma":0.0000030719434,"teacher_disagreement_score":0.8702781,"about_ca_system_score_codex":0.000031030148,"about_ca_system_score_gemma":0.00003636849,"threshold_uncertainty_score":0.999553},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91037256,0.0002886143,0.08663784,0.000120971235,0.00012705232,0.000082589715,0.000022984035,0.000075179574,0.0022721943],"genre_scores_gemma":[0.9987,0.000004351786,0.0011005553,0.000042934975,0.00005538686,0.000001223557,0.000082023595,0.000003826299,0.000009685498],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994401,0.000023287153,0.00016037714,0.00008361468,0.00019387556,0.0000987447],"domain_scores_gemma":[0.9997213,0.000104126266,0.000036989295,0.00007598934,0.00003575262,0.000025848369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000087580105,0.00009210501,0.00014008155,0.00004734336,0.000055527475,0.000025863856,0.00009852085,0.000028642822,0.000052165185],"category_scores_gemma":[0.000025531013,0.000052338393,0.000086441025,0.0005181542,0.000025408099,0.000066405315,0.000009887186,0.000048646783,0.000005796762],"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.000005566846,9.882779e-7,0.0064970604,0.0000077580835,0.000038200553,4.906894e-7,0.000013053869,0.98162675,0.000019712927,0.001242132,0.00017819017,0.010370099],"study_design_scores_gemma":[0.00022025767,0.00007213943,0.2512627,0.000011571373,0.000040539562,0.0000046999307,0.000009767457,0.745208,0.00023955475,0.0027402746,0.00009925315,0.0000912078],"about_ca_topic_score_codex":0.000005823239,"about_ca_topic_score_gemma":7.192305e-7,"teacher_disagreement_score":0.24476564,"about_ca_system_score_codex":0.00002692834,"about_ca_system_score_gemma":0.000004390539,"threshold_uncertainty_score":0.21342978},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011824395,0.00085206435,0.97989,0.0026069898,0.0013972609,0.00035355313,0.000021340104,0.00013839555,0.0029160145],"genre_scores_gemma":[0.91466415,0.000016933163,0.08159621,0.00088593434,0.0007745105,0.00009808325,0.00017983833,0.00001805026,0.0017662839],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980961,0.00009481218,0.0003741953,0.00033378694,0.00056008506,0.0005410385],"domain_scores_gemma":[0.997362,0.0016874039,0.0001604225,0.00033921943,0.00026696394,0.00018394843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009994298,0.00020775599,0.00016318103,0.00021259354,0.0007863506,0.0003445601,0.0006868453,0.000065054475,0.000026125488],"category_scores_gemma":[0.00021274132,0.00015489927,0.0001861056,0.00077615434,0.000091762005,0.00080768194,0.00019529843,0.00012591989,0.00018454119],"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.00003484022,0.000091582224,0.0010249119,0.0000148297295,0.00008537571,6.5021504e-7,0.0002742943,0.03193636,0.00009502269,0.89677316,0.021600218,0.048068777],"study_design_scores_gemma":[0.0011145015,0.00018533376,0.068229,0.000023830667,0.000033759414,0.0000737739,0.00015711559,0.4142858,0.0008121424,0.20775637,0.30655542,0.0007729519],"about_ca_topic_score_codex":0.000001387446,"about_ca_topic_score_gemma":0.0000011846492,"teacher_disagreement_score":0.9028398,"about_ca_system_score_codex":0.000054905373,"about_ca_system_score_gemma":0.00011210634,"threshold_uncertainty_score":0.6316609},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0164325,0.004724623,0.9720744,0.004706812,0.0005518018,0.00036459087,0.000051298397,0.00008238095,0.0010116297],"genre_scores_gemma":[0.93823755,0.00010740002,0.059821982,0.0006760933,0.00019040852,0.000049873383,0.00006412986,0.0000130882745,0.00083945034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981372,0.0000709609,0.00047844407,0.00036525197,0.0006449438,0.00030322315],"domain_scores_gemma":[0.9962946,0.002684798,0.00024914055,0.00028598116,0.00039119314,0.000094280396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004912458,0.00017454271,0.00020163265,0.00014860214,0.00046748447,0.00013732268,0.000696041,0.000047278954,0.0000535671],"category_scores_gemma":[0.0005070472,0.00013985904,0.00019202565,0.0009971248,0.00010667725,0.0003901752,0.00016006292,0.00011369442,0.00001975695],"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.00005370598,0.00026700093,0.001505074,0.0002757038,0.00026321388,0.000004503369,0.0005982632,0.2743934,0.0004886386,0.55221957,0.03168896,0.13824198],"study_design_scores_gemma":[0.0007078263,0.00018832971,0.024987614,0.00010450954,0.00002337147,0.000024395827,0.00004024639,0.91727763,0.000430867,0.044639643,0.011242744,0.00033281904],"about_ca_topic_score_codex":0.000004873062,"about_ca_topic_score_gemma":0.0000012848702,"teacher_disagreement_score":0.9218051,"about_ca_system_score_codex":0.000029869196,"about_ca_system_score_gemma":0.00006108386,"threshold_uncertainty_score":0.5703286},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7419125,0.000072543175,0.25307623,0.00020017468,0.00031217284,0.0002781903,0.000028198529,0.000057168345,0.004062826],"genre_scores_gemma":[0.96946913,0.00000315252,0.030166447,0.000042306892,0.000057499037,0.000003495918,0.000010747622,0.000022132883,0.00022507312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987619,0.00004370213,0.00040692015,0.00015705456,0.00045146846,0.00017898453],"domain_scores_gemma":[0.99748576,0.0017550087,0.0003066452,0.00022476325,0.00017119029,0.00005666435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005208691,0.000121354395,0.00019865338,0.000105454026,0.00013679583,0.000014913722,0.00017939841,0.000074296186,0.000018080635],"category_scores_gemma":[0.0013563879,0.00009480174,0.00007279506,0.0005512465,0.00012079961,0.000084609914,0.0001307118,0.00012589099,0.0000022865795],"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.000008636467,0.00007555252,0.00838137,0.00008967474,0.000039679704,9.266814e-7,0.00042458,0.00093288196,0.00010357162,0.98906076,0.0002476914,0.0006346464],"study_design_scores_gemma":[0.0003158446,0.000025324853,0.042265307,0.000053981996,0.000032508684,0.000007714384,0.00018954011,0.001109915,0.00029882893,0.9553507,0.00023468079,0.00011564765],"about_ca_topic_score_codex":0.0000054589327,"about_ca_topic_score_gemma":0.0000056766607,"teacher_disagreement_score":0.22755665,"about_ca_system_score_codex":0.00005813453,"about_ca_system_score_gemma":0.000036190762,"threshold_uncertainty_score":0.38659027},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035880834,0.00031153226,0.96132183,0.0009879395,0.00026278483,0.00057211233,0.00007562006,0.000107142965,0.00048018983],"genre_scores_gemma":[0.843952,0.0000048557067,0.15427178,0.0009100011,0.0003634537,0.00017335652,0.00023463642,0.000012933359,0.000077003424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864346,0.00004193661,0.00025953117,0.00037772508,0.00031858173,0.00035875675],"domain_scores_gemma":[0.99893206,0.00041003947,0.00006493872,0.00018234109,0.00015144103,0.0002591792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034015047,0.00017816675,0.00016428085,0.00041715408,0.00032332077,0.00016741347,0.00029550956,0.000053026466,0.0000119990345],"category_scores_gemma":[0.000032231903,0.00017591956,0.00009245678,0.00084563054,0.00004089054,0.0005993588,0.00009897605,0.00007703148,0.00003091332],"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.000038327573,0.00013560781,0.0043904805,0.000059993297,0.00007959515,7.1001466e-7,0.0012133392,0.04261942,0.00040884296,0.8522779,0.00066664774,0.09810919],"study_design_scores_gemma":[0.004769364,0.0006322907,0.1510684,0.00011017276,0.00013678256,0.00036332113,0.00060413044,0.27998987,0.0017098003,0.36756843,0.19052799,0.0025194325],"about_ca_topic_score_codex":0.0000030232356,"about_ca_topic_score_gemma":9.753555e-7,"teacher_disagreement_score":0.80807114,"about_ca_system_score_codex":0.000027907357,"about_ca_system_score_gemma":0.000041271313,"threshold_uncertainty_score":0.71737915},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.494498,0.00035730767,0.50286555,0.0013744158,0.00019569187,0.0001564191,0.000007912282,0.00008437352,0.00046027382],"genre_scores_gemma":[0.9585799,0.000027643358,0.04018155,0.00073404255,0.0001221172,0.000020951635,0.0001093787,0.000013612974,0.0002108012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978648,0.00008035875,0.00043753308,0.0006293139,0.0005933333,0.0003946609],"domain_scores_gemma":[0.99887043,0.00038793604,0.0001143863,0.00026948622,0.0001619203,0.00019581932],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036187377,0.00024465247,0.00025037857,0.00082455203,0.0002486881,0.00017234073,0.00039076462,0.00009075938,0.000048436556],"category_scores_gemma":[0.000087893415,0.00024969535,0.000078516416,0.00213253,0.00008912144,0.00058296736,0.0003085332,0.00022064411,0.000050634582],"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.00006390816,0.00027402028,0.04549062,0.000023391449,0.000070191956,0.0001249715,0.0005890211,0.3198875,0.0004236932,0.59371006,0.00033202808,0.039010603],"study_design_scores_gemma":[0.00082687545,0.00007759535,0.2926776,0.000025128149,0.0000058997393,0.000118669566,0.00003650084,0.6370692,0.00003111379,0.06793947,0.000884559,0.00030734125],"about_ca_topic_score_codex":0.000041074105,"about_ca_topic_score_gemma":0.000059466976,"teacher_disagreement_score":0.5257706,"about_ca_system_score_codex":0.00007202214,"about_ca_system_score_gemma":0.00015303327,"threshold_uncertainty_score":0.9999955},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7196338,0.000019415096,0.27597067,0.00066772714,0.0001685105,0.00066544017,0.00035274637,0.00012523442,0.002396422],"genre_scores_gemma":[0.7660708,0.0000015600617,0.2330094,0.00014277932,0.00012325603,0.000114750444,0.0001936232,0.00003127927,0.00031254755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989395,0.000018753804,0.0002898636,0.0003161196,0.00022286439,0.00021290513],"domain_scores_gemma":[0.9983814,0.0008454639,0.00012666242,0.0003505655,0.00013830018,0.0001576146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003780566,0.00016410615,0.00020239937,0.00012394313,0.0002766174,0.00011088736,0.0002117676,0.00007567046,0.0002322097],"category_scores_gemma":[0.00015208039,0.00014685167,0.00009080414,0.00017505475,0.00011760154,0.00011657912,0.000054718137,0.00016260735,0.000017023965],"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.000008840547,0.00017614008,0.0004135392,0.00008245358,0.000041296826,4.7514143e-7,0.00033486303,0.00010249877,0.001130486,0.99102086,0.0050495784,0.0016389516],"study_design_scores_gemma":[0.000522061,0.000066878005,0.002887513,0.000014577045,0.00006485558,0.000024684063,0.00032437997,0.06024637,0.0001706758,0.9255769,0.009802963,0.00029812325],"about_ca_topic_score_codex":0.0000046410846,"about_ca_topic_score_gemma":0.00001497806,"teacher_disagreement_score":0.065443955,"about_ca_system_score_codex":0.000008526194,"about_ca_system_score_gemma":0.000041088097,"threshold_uncertainty_score":0.59884375},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1993608,0.000123946,0.79429775,0.0026367395,0.0004328669,0.00026904617,0.000028206041,0.00024034225,0.0026102758],"genre_scores_gemma":[0.9147327,0.000003759578,0.08252026,0.0015508306,0.0002916748,0.000019256751,0.00047000844,0.000026730808,0.00038477735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99665266,0.00008880361,0.00055595255,0.0008220951,0.0012316485,0.0006488431],"domain_scores_gemma":[0.99745,0.00070480804,0.0002465144,0.00047537664,0.00075722364,0.00036608352],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008852894,0.00036550008,0.00033139094,0.0006985585,0.00058078667,0.0005569709,0.0007729345,0.00012507499,0.0000744828],"category_scores_gemma":[0.00012360707,0.0003341133,0.00011525126,0.0035508333,0.00015627393,0.00065550534,0.0002319402,0.0003188493,0.00007137534],"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.00016126693,0.0004423419,0.018277412,0.00008127214,0.00033120986,0.00014118727,0.002082436,0.45079425,0.0004509878,0.46763858,0.002735238,0.056863803],"study_design_scores_gemma":[0.0037124907,0.0010682936,0.4810015,0.00012470101,0.00008504563,0.00053540576,0.00044202025,0.43785816,0.0029703944,0.04649539,0.023444487,0.0022621204],"about_ca_topic_score_codex":0.000060658433,"about_ca_topic_score_gemma":0.00024812922,"teacher_disagreement_score":0.7153719,"about_ca_system_score_codex":0.00013060545,"about_ca_system_score_gemma":0.00047831217,"threshold_uncertainty_score":0.99991107},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56634104,0.0004728709,0.43076134,0.00028732486,0.00031664636,0.00017027844,0.0000112916205,0.000049413622,0.0015898179],"genre_scores_gemma":[0.9532368,0.000015689806,0.04647689,0.0001318784,0.000045453107,0.000017927128,0.000031301628,0.000008671855,0.00003536764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9981815,0.00008763423,0.00051945157,0.0003597695,0.00057331246,0.00027830503],"domain_scores_gemma":[0.99855256,0.0006215477,0.0001909905,0.00030920317,0.00023948027,0.000086234024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053907634,0.00016320299,0.0001832495,0.000379185,0.00024511313,0.00006264129,0.00069909333,0.00005738579,0.000053337102],"category_scores_gemma":[0.00011062649,0.0001285198,0.00011436236,0.0015087742,0.00012881837,0.00038813316,0.0002801663,0.00016267074,0.00003374629],"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.000038537226,0.00015557696,0.024028404,0.000012376179,0.0000494953,0.00001171479,0.0005165557,0.05961885,0.00012304475,0.8757265,0.00011336271,0.03960559],"study_design_scores_gemma":[0.0002783246,0.00006388264,0.49894527,0.000017655742,0.0000047323606,0.000012792598,0.00003638312,0.31690124,0.0001646573,0.18326229,0.00016580524,0.00014697264],"about_ca_topic_score_codex":0.000030151952,"about_ca_topic_score_gemma":0.00005722161,"teacher_disagreement_score":0.69246423,"about_ca_system_score_codex":0.000030397136,"about_ca_system_score_gemma":0.00016223351,"threshold_uncertainty_score":0.5240885},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98628414,0.0009367324,0.00881713,0.0001685683,0.00026044334,0.00019159085,0.000053154403,0.000046269604,0.003241986],"genre_scores_gemma":[0.9963866,0.0000061272412,0.003134926,0.00027592015,0.00007613252,0.000014069268,0.000035183748,0.00001727428,0.00005379504],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9986841,0.00011223062,0.00023985296,0.0002940659,0.00038769437,0.0002820477],"domain_scores_gemma":[0.999371,0.00020097649,0.00009262912,0.00022162785,0.000045541285,0.00006825333],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00042166948,0.00016667494,0.00019670422,0.000068702335,0.00021780454,0.00021018018,0.00033070502,0.00006231251,0.0017973401],"category_scores_gemma":[0.00006605955,0.0001035013,0.00006883795,0.0002849827,0.00013842378,0.00026774523,0.000040889183,0.0001240339,0.000073192154],"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.00065599044,0.0004672429,0.07813277,0.00022705084,0.000096771124,0.00008056363,0.0049620974,0.42806634,0.1048459,0.33816168,0.0030713263,0.041232258],"study_design_scores_gemma":[0.0028933575,0.0006556632,0.48833552,0.00014795655,0.00005009243,0.00009793281,0.005148542,0.020105243,0.04243349,0.40912792,0.029535545,0.001468719],"about_ca_topic_score_codex":0.0002050785,"about_ca_topic_score_gemma":0.0002455656,"teacher_disagreement_score":0.41020274,"about_ca_system_score_codex":0.00003264628,"about_ca_system_score_gemma":0.0000642764,"threshold_uncertainty_score":0.99911517},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1659756,0.0001688907,0.82537377,0.005180284,0.0012986948,0.00023445202,0.00007567345,0.00025830316,0.0014343115],"genre_scores_gemma":[0.9505515,0.0000071671134,0.04604974,0.0011316034,0.0004180419,0.00002082542,0.00034819223,0.000022445764,0.001450496],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99683756,0.00015639639,0.00041271283,0.0007798884,0.0013403909,0.00047303695],"domain_scores_gemma":[0.997874,0.00036379806,0.0002209416,0.00047389691,0.0006292082,0.00043813683],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041657317,0.0003509392,0.000312262,0.0005548951,0.00023821651,0.00071916066,0.00090964325,0.00012702636,0.0001333375],"category_scores_gemma":[0.00023382122,0.00029714854,0.00017505049,0.0015598263,0.000077791075,0.0014099539,0.00038193224,0.00026462623,0.00030732842],"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.00004990932,0.00031222057,0.0040058955,0.00007716984,0.00019529705,0.000083178275,0.0026961344,0.81367975,0.00027550408,0.09492284,0.021102905,0.062599175],"study_design_scores_gemma":[0.0014857339,0.00021972369,0.01729396,0.00004773037,0.0000133156245,0.000060779388,0.0002590348,0.90496635,0.0010477116,0.05242797,0.021289404,0.00088826363],"about_ca_topic_score_codex":0.000012094103,"about_ca_topic_score_gemma":0.000009061185,"teacher_disagreement_score":0.7845759,"about_ca_system_score_codex":0.00016553934,"about_ca_system_score_gemma":0.00039758236,"threshold_uncertainty_score":0.9999481},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31771064,0.00021671888,0.68027455,0.00052210543,0.0004447209,0.00021808773,0.00006154738,0.00018725019,0.00036436375],"genre_scores_gemma":[0.8575761,0.000006235509,0.14046322,0.00078162964,0.00031261213,0.00004171463,0.00041003074,0.000020671576,0.00038780234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977008,0.00006436838,0.00045854,0.000666651,0.0006011669,0.00050844747],"domain_scores_gemma":[0.997951,0.0008194202,0.00019586674,0.00029724132,0.00047303853,0.00026348713],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00046842385,0.0002594582,0.00026772186,0.00029137282,0.0014403937,0.00027611648,0.00061685697,0.00009813013,0.000060763003],"category_scores_gemma":[0.00040401903,0.00026982094,0.00021420029,0.0012828674,0.000103746985,0.0008491399,0.00021864129,0.00015631945,0.000061015475],"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.000088053755,0.00013804562,0.008243359,0.00009443256,0.00024251122,0.000046597866,0.0048542754,0.75725234,0.0010787145,0.19293556,0.009855681,0.025170438],"study_design_scores_gemma":[0.0015971917,0.0002520151,0.024758235,0.00002312724,0.000014628027,0.0002676014,0.0002245719,0.90936303,0.0012968864,0.035610728,0.025834644,0.000757351],"about_ca_topic_score_codex":0.00000822156,"about_ca_topic_score_gemma":0.0000037818904,"teacher_disagreement_score":0.53986543,"about_ca_system_score_codex":0.00008388133,"about_ca_system_score_gemma":0.00023970114,"threshold_uncertainty_score":0.9999754},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32708448,0.00035273875,0.6704396,0.00023200232,0.00012037255,0.000065404565,0.000056265693,0.000044497658,0.0016046491],"genre_scores_gemma":[0.9197111,0.00004423907,0.07998846,0.00007516041,0.000030500161,0.000003608664,0.00007806992,0.0000047629455,0.000064105436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9980557,0.000065246335,0.0005747745,0.00037389726,0.00069228106,0.00023810177],"domain_scores_gemma":[0.9983732,0.00045990883,0.00036848473,0.0003693406,0.00032390442,0.00010514232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032824388,0.000148024,0.0003833614,0.0017672343,0.00009100835,0.000049303082,0.00072259986,0.000073606774,0.00025111876],"category_scores_gemma":[0.00026571116,0.00012900519,0.00020469271,0.009890215,0.00027713345,0.00042660072,0.00029509768,0.00011585023,0.000030487807],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008171012,0.0006525318,0.12939581,0.00010453136,0.00049461087,0.000044693297,0.00020435464,0.07727424,0.00018646473,0.47841558,0.0005797244,0.31256574],"study_design_scores_gemma":[0.0016869372,0.0006749318,0.6184292,0.000056876837,0.00011676709,0.0002445979,0.00026565118,0.16129358,0.0006880466,0.21100202,0.0048486334,0.0006927836],"about_ca_topic_score_codex":0.00011967149,"about_ca_topic_score_gemma":0.0000015996985,"teacher_disagreement_score":0.59262663,"about_ca_system_score_codex":0.000027878114,"about_ca_system_score_gemma":0.000081090475,"threshold_uncertainty_score":0.5260679},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98539954,0.00015954096,0.013493034,0.00003582013,0.00008854514,0.00031491413,0.0000149849175,0.000021932263,0.00047168508],"genre_scores_gemma":[0.86394453,0.0000031453542,0.13598433,0.000014291902,0.000006394319,0.0000074425234,0.000004617782,0.000017784225,0.000017445236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984777,0.00011063073,0.00064022484,0.0001781108,0.00043118643,0.00016216467],"domain_scores_gemma":[0.9967968,0.0023863087,0.00040315653,0.00020635784,0.00016531788,0.000042061867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069637457,0.00015415091,0.00044523375,0.00018675695,0.000043512966,0.0000059822305,0.00017891086,0.00006097952,0.000030688298],"category_scores_gemma":[0.0006167732,0.000112768845,0.000098323915,0.00055730896,0.00033134987,0.00010189368,0.00014550978,0.00014400459,0.000001252626],"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.00018752963,0.00019542998,0.008461385,0.00027147375,0.000083332816,0.0000034151205,0.0030225646,0.004683598,0.00006826209,0.9828226,0.000042758675,0.00015766184],"study_design_scores_gemma":[0.0016716655,0.000054863467,0.005407201,0.00014904347,0.000026631878,0.000009606676,0.00032018308,0.022856971,0.00038116227,0.96900374,0.0000030710682,0.00011588794],"about_ca_topic_score_codex":0.000019590836,"about_ca_topic_score_gemma":0.0000015053371,"teacher_disagreement_score":0.1224913,"about_ca_system_score_codex":0.000016379016,"about_ca_system_score_gemma":0.00004711571,"threshold_uncertainty_score":0.459858},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21202469,0.00055470393,0.78489035,0.00049790606,0.00081148365,0.00038449906,0.00007129483,0.00021502314,0.00055006717],"genre_scores_gemma":[0.84912235,0.00002051094,0.14878277,0.00074181875,0.00038756823,0.000067142886,0.00047467233,0.000025474354,0.00037766434],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972124,0.00006921146,0.00057779567,0.0007733894,0.00082607364,0.0005411157],"domain_scores_gemma":[0.99785715,0.00087946776,0.0002347771,0.00035426058,0.00043608228,0.00023827712],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004337041,0.00032019796,0.00034015166,0.0016211877,0.00088068476,0.0002269131,0.0007710453,0.00012220095,0.000030676696],"category_scores_gemma":[0.00021620095,0.00033762114,0.00029063266,0.0035882483,0.00011163935,0.0008149642,0.00013792625,0.00019174925,0.00007271534],"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.00030739102,0.0006729019,0.011324885,0.00016616596,0.00055178377,0.00015442066,0.001458514,0.66902965,0.00084030966,0.17988302,0.08249956,0.053111386],"study_design_scores_gemma":[0.005264768,0.00089701725,0.11989671,0.000058546775,0.00007108236,0.00079357636,0.00010264603,0.7667894,0.0013488708,0.05885068,0.043956436,0.0019702693],"about_ca_topic_score_codex":0.000021580106,"about_ca_topic_score_gemma":0.000002780777,"teacher_disagreement_score":0.63709766,"about_ca_system_score_codex":0.00011400865,"about_ca_system_score_gemma":0.00033989234,"threshold_uncertainty_score":0.99990755},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3006441,0.0002149182,0.6933713,0.00010949685,0.00045476056,0.00016885293,0.0001142417,0.000085574444,0.0048367693],"genre_scores_gemma":[0.9303889,0.0000018003,0.06784277,0.00009334517,0.00035138484,0.000020368736,0.00019194842,0.000027240683,0.0010822206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980969,0.00004805077,0.0006696311,0.00019034318,0.0005818088,0.0004132571],"domain_scores_gemma":[0.9976704,0.0013672231,0.00034737907,0.00019582346,0.00027957914,0.00013960255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007742289,0.0002066377,0.0004100306,0.0005088052,0.00017226233,0.00003581706,0.00017861686,0.00007721579,0.0009095494],"category_scores_gemma":[0.0008596228,0.00017399964,0.00017844599,0.0011098564,0.00008943421,0.00045585385,0.00010149152,0.0001531801,0.000094454204],"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.0008890812,0.0033215124,0.17954548,0.006389519,0.002416517,0.000020340238,0.014883063,0.079889126,0.0006027785,0.6058296,0.026515042,0.07969796],"study_design_scores_gemma":[0.009613907,0.0008503019,0.078204095,0.0004423265,0.00081138633,0.0003963037,0.0053252885,0.11840151,0.0019327299,0.77438474,0.0070321825,0.0026052266],"about_ca_topic_score_codex":0.000042640382,"about_ca_topic_score_gemma":0.0000016556711,"teacher_disagreement_score":0.6297448,"about_ca_system_score_codex":0.000036260197,"about_ca_system_score_gemma":0.00007275721,"threshold_uncertainty_score":0.9958928},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8186098,0.000481703,0.176283,0.00088014855,0.00023387946,0.00030118716,0.000034847475,0.00026399555,0.0029114818],"genre_scores_gemma":[0.9349277,0.000007741432,0.06437595,0.00022613698,0.00013266495,0.0000058302003,0.000019532356,0.000024580997,0.00027984046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881345,0.000037087582,0.00033844064,0.00026915467,0.00028441878,0.00025744052],"domain_scores_gemma":[0.9985517,0.0008563307,0.00015244634,0.00022453548,0.00010671067,0.00010822897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017821495,0.00022908175,0.0003159613,0.0001608901,0.00014285611,0.00007554527,0.00018586568,0.00006980957,0.000047331312],"category_scores_gemma":[0.000414465,0.00019127515,0.0000828231,0.00031939454,0.000070941205,0.00019894254,0.00007281035,0.00015135511,0.000024545468],"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.000024826679,0.00013825244,0.0006226689,0.00007250904,0.000055945377,0.0000061601736,0.0006582579,0.000457137,0.00022612912,0.9848303,0.0011562699,0.011751551],"study_design_scores_gemma":[0.00040169997,0.000109080735,0.0053903605,0.000041598036,0.00001542777,0.00003138822,0.0002402028,0.0046061673,0.00019116784,0.98828495,0.0004530535,0.00023491897],"about_ca_topic_score_codex":0.000001405659,"about_ca_topic_score_gemma":4.842383e-7,"teacher_disagreement_score":0.11631796,"about_ca_system_score_codex":0.000036876394,"about_ca_system_score_gemma":0.000028706032,"threshold_uncertainty_score":0.7799974},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12183662,0.00032595155,0.8748202,0.00081063015,0.00030688354,0.00020338364,0.00001985643,0.00023390456,0.0014425777],"genre_scores_gemma":[0.84165,0.0000036432598,0.15757687,0.00039073217,0.000083590305,0.000020213123,0.00009500048,0.000020627229,0.00015929677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99686724,0.0000860349,0.00039860408,0.0007099054,0.0014187469,0.00051946286],"domain_scores_gemma":[0.9984095,0.0003788673,0.00015983246,0.0004571794,0.0003362034,0.00025838643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052142545,0.00023880001,0.00025055002,0.0011211765,0.0003614527,0.0001790159,0.0009133156,0.00008478664,0.00008024668],"category_scores_gemma":[0.00022021767,0.00024305415,0.00016888775,0.003535131,0.00016782017,0.0010320633,0.0004483277,0.00032584215,0.00034765183],"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.000026753354,0.00015940423,0.00059849006,0.000016391135,0.00005696444,0.000027114631,0.00013641032,0.41844404,0.0002667118,0.57089657,0.00012351369,0.009247653],"study_design_scores_gemma":[0.0012332769,0.00019856774,0.0357271,0.000039338076,0.000012240261,0.00005885027,0.000028032895,0.041924655,0.0009940112,0.91882044,0.00045433032,0.0005091401],"about_ca_topic_score_codex":0.00001561649,"about_ca_topic_score_gemma":0.000001783753,"teacher_disagreement_score":0.7198134,"about_ca_system_score_codex":0.0002801583,"about_ca_system_score_gemma":0.00019831407,"threshold_uncertainty_score":0.991146},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89515543,0.00016652366,0.102643274,0.00015838702,0.0003270761,0.00034346737,0.000021100745,0.00010404694,0.0010806884],"genre_scores_gemma":[0.9353168,0.0000030123274,0.06447005,0.00003777782,0.000037040907,0.000021639456,0.000012548926,0.000030867526,0.000070250404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998511,0.000038465787,0.00046999333,0.00022478252,0.00054391456,0.00021183272],"domain_scores_gemma":[0.99887353,0.00028533672,0.0002666976,0.00022208692,0.00028078494,0.00007153852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016929026,0.00019769631,0.00034025003,0.00021690299,0.000098036515,0.0000223553,0.00021788567,0.000065715605,0.000024561694],"category_scores_gemma":[0.00067551003,0.00017060326,0.00013290995,0.0005691596,0.00016755503,0.00019203735,0.000081218925,0.00014932436,0.000021240345],"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.00003120582,0.00018368833,0.00016147316,0.00019741754,0.00010030888,0.0000037339362,0.0015119577,0.012590557,0.0006732083,0.9843105,0.00005451675,0.00018141053],"study_design_scores_gemma":[0.0007892963,0.00009254554,0.00037625973,0.00016757716,0.000024414569,0.000008936931,0.00050742377,0.00040586945,0.0058083194,0.99158585,0.00003066952,0.00020284852],"about_ca_topic_score_codex":0.000009722689,"about_ca_topic_score_gemma":0.000001505855,"teacher_disagreement_score":0.040161375,"about_ca_system_score_codex":0.00007917078,"about_ca_system_score_gemma":0.000105059524,"threshold_uncertainty_score":0.69569993},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77120644,0.0020704737,0.21430019,0.005865227,0.0008535811,0.00033526102,0.00016873356,0.00018379276,0.005016304],"genre_scores_gemma":[0.989422,0.00010574384,0.0073497267,0.0010049479,0.00034256905,0.000010049263,0.00029963022,0.00004294941,0.0014223898],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977443,0.0001151952,0.000499456,0.0004138531,0.00073765824,0.00048953097],"domain_scores_gemma":[0.9939945,0.0051868963,0.0002419235,0.0003333905,0.00011348807,0.00012983986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043591883,0.00027550454,0.00031724462,0.00031159946,0.00051947683,0.00011249725,0.00040222026,0.00011507365,0.0003930823],"category_scores_gemma":[0.0007527455,0.00020982325,0.00018763151,0.00089054526,0.00019003569,0.0001189921,0.00013705024,0.00036645486,0.00021670743],"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.00014401734,0.00024341444,0.021598808,0.00008434065,0.000506847,0.0000782571,0.00018226173,0.006997564,0.000010302802,0.9223326,0.012318994,0.035502616],"study_design_scores_gemma":[0.00083625515,0.00014213954,0.05536451,0.000275726,0.00011398071,0.00004884529,0.00073236565,0.0846348,0.000017039498,0.8534966,0.0037918782,0.0005458639],"about_ca_topic_score_codex":0.00006625322,"about_ca_topic_score_gemma":0.000021567606,"teacher_disagreement_score":0.21821554,"about_ca_system_score_codex":0.00013251725,"about_ca_system_score_gemma":0.0000635214,"threshold_uncertainty_score":0.8556344},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4051732,0.00010937432,0.593003,0.0001619974,0.00021714566,0.00030006302,0.00021628068,0.00003347612,0.00078550086],"genre_scores_gemma":[0.99094105,0.0000023173814,0.008712757,0.00016227023,0.00006104966,0.000025074847,0.000030554533,0.000021130883,0.00004378713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99846935,0.00007948529,0.00039881587,0.00015940412,0.0006050127,0.00028792996],"domain_scores_gemma":[0.9913529,0.007984618,0.00019663743,0.00019225433,0.00016307342,0.00011052489],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00038078145,0.00017928763,0.00033454568,0.000115631075,0.00010683784,0.00002391787,0.0002084226,0.00006356132,0.0010391141],"category_scores_gemma":[0.0026216481,0.00011252194,0.00015268134,0.00038803558,0.00008346465,0.000074004376,0.00005028787,0.00017147846,0.00003632166],"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.0002814248,0.00012109307,0.000078009696,0.000069415466,0.00009577994,7.0245017e-7,0.00043189808,0.00016605263,0.000023928984,0.9966949,0.00083988445,0.0011968842],"study_design_scores_gemma":[0.0022003825,0.00009701239,0.0009626384,0.000054394615,0.000056948775,0.0000045666675,0.00024012654,0.021887213,0.00021301789,0.97409534,0.000024747083,0.00016360571],"about_ca_topic_score_codex":0.0000024974759,"about_ca_topic_score_gemma":3.3423632e-7,"teacher_disagreement_score":0.58576787,"about_ca_system_score_codex":0.000016560774,"about_ca_system_score_gemma":0.000035071847,"threshold_uncertainty_score":0.99987406},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9550851,0.00088226807,0.04088697,0.00017586553,0.00010228734,0.00022203261,0.00008218249,0.00007728037,0.0024860275],"genre_scores_gemma":[0.9923382,0.00002463756,0.0070038624,0.0000799233,0.00008611995,0.000016413494,0.000028346862,0.000020588544,0.00040192972],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998079,0.00008486709,0.0006415559,0.0002570719,0.000665209,0.00027228828],"domain_scores_gemma":[0.9982476,0.0007507881,0.00025390417,0.00022556313,0.0004421899,0.00007995382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047007622,0.00019541552,0.00045747243,0.00032138126,0.00017588664,0.000023910148,0.00023048317,0.00006926937,0.00031970936],"category_scores_gemma":[0.0012142668,0.00015356248,0.00017815125,0.00088912016,0.0002562514,0.00025839813,0.00009179024,0.00013528806,0.000017086257],"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.0034275914,0.003317395,0.09784723,0.0089158425,0.0017628164,0.00008916779,0.03046536,0.0104666315,0.004169024,0.82430506,0.0060511813,0.009182721],"study_design_scores_gemma":[0.010155711,0.00087295816,0.078698486,0.00059449393,0.00023455992,0.00027806722,0.0062556034,0.015837606,0.042224173,0.84105927,0.0017085059,0.00208059],"about_ca_topic_score_codex":0.00008352143,"about_ca_topic_score_gemma":0.000002833141,"teacher_disagreement_score":0.03805515,"about_ca_system_score_codex":0.00003436063,"about_ca_system_score_gemma":0.00016071764,"threshold_uncertainty_score":0.6262096},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9483357,0.0010036245,0.04274375,0.00016492733,0.0004507636,0.00025790048,0.0003987686,0.00005485266,0.006589706],"genre_scores_gemma":[0.99613416,0.00018204922,0.003157023,0.000083933075,0.00013833083,0.000014245786,0.00011475343,0.000029818384,0.00014570006],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9977719,0.000049873266,0.00070649164,0.0004003929,0.00047941683,0.000591915],"domain_scores_gemma":[0.9990447,0.0003755925,0.00012165655,0.00020387436,0.00009038534,0.0001637987],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021332977,0.00033803366,0.0005888178,0.00034159052,0.00021383878,0.00002777846,0.00033017842,0.00012753133,0.00091176864],"category_scores_gemma":[0.00008830471,0.00030813718,0.00016783968,0.0015785872,0.00071626337,0.00014154587,0.00023101452,0.00025046425,0.00005842114],"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.0003513862,0.0003655088,0.034341082,0.00041123846,0.00027207725,0.000114834,0.0017946503,0.75491965,0.0018818199,0.20012093,0.00024095326,0.005185859],"study_design_scores_gemma":[0.004338027,0.00081057893,0.47111744,0.00032861452,0.000107812906,0.000059780123,0.004334781,0.13689044,0.0015233129,0.37099788,0.007379547,0.002111787],"about_ca_topic_score_codex":0.00010492218,"about_ca_topic_score_gemma":0.0000073606825,"teacher_disagreement_score":0.61802924,"about_ca_system_score_codex":0.00006164983,"about_ca_system_score_gemma":0.00004530167,"threshold_uncertainty_score":0.99993706},"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":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016490589,0.00038997855,0.3097316,0.6771037,0.008262348,0.0005276619,0.00074826705,0.00042698157,0.0011603686],"genre_scores_gemma":[0.015833424,0.000021285678,0.040505093,0.7595986,0.1697172,0.00020697783,0.012981788,0.00035692228,0.0007787208],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99789506,0.000034207886,0.000500169,0.0004752291,0.00066654617,0.00042881462],"domain_scores_gemma":[0.99822897,0.0009283899,0.00009633333,0.0006000076,0.0000721431,0.00007418719],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00010597501,0.000426837,0.000340304,0.0002321273,0.00010178931,0.00015073459,0.0007920622,0.0010492048,0.00037981255],"category_scores_gemma":[0.000045144716,0.00036782367,0.00017626442,0.00046231205,0.00008210913,0.00010412446,0.000109359324,0.0046685133,0.0005662121],"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":[9.1015613e-7,0.0000038749595,0.00009056586,0.000012719756,0.00004631213,0.0000092999535,0.00006236122,0.23264396,0.000010519656,0.00003402758,0.7664501,0.00063533237],"study_design_scores_gemma":[0.00019392409,0.000005324143,0.002600167,0.0000512505,0.000034949102,0.0000028426125,0.0000029008097,0.09277077,0.000008593137,0.01040389,0.8935086,0.00041677651],"about_ca_topic_score_codex":0.0005953801,"about_ca_topic_score_gemma":0.00007846866,"teacher_disagreement_score":0.26922652,"about_ca_system_score_codex":0.000093638744,"about_ca_system_score_gemma":0.00010159822,"threshold_uncertainty_score":0.9998774},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5936434,0.000008849732,0.40000567,0.00016529376,0.00004361773,0.00023684018,0.000024279765,0.000034372013,0.0058376295],"genre_scores_gemma":[0.9256011,3.0988787e-7,0.07388123,0.00009653668,0.000031141743,0.0000052263217,0.00003008317,0.00001232952,0.00034204283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887353,0.000025448848,0.00036667695,0.00012590915,0.00047525487,0.00013317582],"domain_scores_gemma":[0.9983851,0.0010469581,0.00022180662,0.00015680522,0.0001445467,0.000044830344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039789343,0.00011006798,0.00017503568,0.00009262493,0.00007308346,0.000019712134,0.00015075713,0.000045679615,0.00017776422],"category_scores_gemma":[0.00052994676,0.00006317157,0.00007577024,0.00039087783,0.00009222493,0.00008423307,0.00003415366,0.00010276818,0.000011660103],"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.0001711502,0.00020985672,0.00519975,0.00023542966,0.00007655837,0.0000017112778,0.0008033389,0.0007444844,0.00032083652,0.98978955,0.0008649018,0.001582407],"study_design_scores_gemma":[0.0028525086,0.00026704057,0.081506185,0.00036350073,0.00008722222,0.00005186474,0.0014280824,0.046062,0.013821716,0.85135525,0.0017268189,0.00047782718],"about_ca_topic_score_codex":0.000008407892,"about_ca_topic_score_gemma":0.000015206173,"teacher_disagreement_score":0.33195764,"about_ca_system_score_codex":0.000025411455,"about_ca_system_score_gemma":0.00002981012,"threshold_uncertainty_score":0.25760618},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87089574,0.00041518928,0.12643115,0.0001151952,0.00063801085,0.000086705106,0.000031634216,0.00009076666,0.0012955951],"genre_scores_gemma":[0.97949,0.000027477776,0.020230498,0.000015027758,0.0001244298,0.00000374556,0.000054173994,0.000012638479,0.000042017076],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992033,0.000012803825,0.00025011128,0.00010988199,0.00028402585,0.0001398317],"domain_scores_gemma":[0.99919635,0.00042398958,0.00006391949,0.00015173592,0.000116445706,0.000047577694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012843501,0.000103434184,0.00013570931,0.0001798779,0.00012263448,0.000053182877,0.00017921798,0.000074187534,0.00015165732],"category_scores_gemma":[0.00015500582,0.00007168674,0.00010285324,0.001214331,0.000057898018,0.00007709695,0.000028549455,0.00024232354,0.000021044358],"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.0000049512364,0.0000057560032,0.003780352,0.000020826476,0.000086001084,5.984633e-7,0.00003297897,0.90726316,0.000175475,0.08199622,0.00029984885,0.0063338573],"study_design_scores_gemma":[0.000115829855,0.000013530162,0.109528825,0.000010050884,0.000034166707,0.0000048396364,0.000030398971,0.845619,0.00026931046,0.043145217,0.0010725827,0.00015621477],"about_ca_topic_score_codex":0.000011537673,"about_ca_topic_score_gemma":0.0000049936407,"teacher_disagreement_score":0.108594246,"about_ca_system_score_codex":0.0000135872615,"about_ca_system_score_gemma":0.000012407573,"threshold_uncertainty_score":0.29233006},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6170448,0.000089798436,0.3811921,0.00048581723,0.00024708046,0.00018160521,0.000031786094,0.000037553848,0.0006894645],"genre_scores_gemma":[0.9766043,0.0000041408957,0.022547606,0.00047175479,0.00008822758,0.000016989781,0.00011423099,0.000014867495,0.0001379289],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970787,0.00014094633,0.00068625365,0.00048816012,0.0013183439,0.00028756468],"domain_scores_gemma":[0.99706227,0.001427707,0.0004245996,0.00047104826,0.0005080724,0.00010631529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004455678,0.00026569446,0.00036352567,0.00034084494,0.00029474683,0.000038052676,0.0007745153,0.00008661388,0.0002488118],"category_scores_gemma":[0.00012629702,0.00020534804,0.00022891408,0.0016292209,0.00023272642,0.00035929427,0.0002989436,0.00022062768,0.000094948926],"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.00012965382,0.00038904077,0.0046453276,0.000041015504,0.00017977317,0.00001538016,0.00048646887,0.5135221,0.0009136174,0.47395453,0.0028075788,0.0029155198],"study_design_scores_gemma":[0.0018110627,0.00044749616,0.19224761,0.00011814119,0.0000344366,0.0002971122,0.0000449173,0.65509456,0.0027015966,0.14618112,0.00036122106,0.00066074886],"about_ca_topic_score_codex":0.000026095257,"about_ca_topic_score_gemma":0.0000033191222,"teacher_disagreement_score":0.35955945,"about_ca_system_score_codex":0.000041705884,"about_ca_system_score_gemma":0.00020615272,"threshold_uncertainty_score":0.83738506},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.263259,0.00008815843,0.7333792,0.00094650406,0.00021793736,0.0003370144,0.0000082198285,0.00028533567,0.0014786832],"genre_scores_gemma":[0.67909056,0.0000011534901,0.31982094,0.0005841574,0.0001448938,0.000022611535,0.00019051386,0.000016241958,0.00012895408],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971964,0.00011550939,0.00047588252,0.0007425467,0.0009315667,0.0005381411],"domain_scores_gemma":[0.9981358,0.00033484653,0.00021625488,0.00041810266,0.00061699125,0.0002780021],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002824545,0.000338673,0.00031630817,0.00043536344,0.00047881113,0.0006761295,0.00078318396,0.00008055003,0.00019318673],"category_scores_gemma":[0.00003949202,0.00029961922,0.00012841607,0.0018679954,0.00018008659,0.0011790383,0.00033602843,0.00026464582,0.00041024564],"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.000014112449,0.00014754588,0.0031696253,0.000029323144,0.000105060935,0.000016076718,0.00042480233,0.80591416,0.00010109997,0.144055,0.0017736757,0.04424954],"study_design_scores_gemma":[0.000719701,0.00022027892,0.101594664,0.000030022635,0.000011727408,0.00011463339,0.00009218723,0.87887484,0.0001259858,0.01650029,0.0012103992,0.00050526316],"about_ca_topic_score_codex":0.00011342666,"about_ca_topic_score_gemma":0.000005474636,"teacher_disagreement_score":0.41583157,"about_ca_system_score_codex":0.00007806247,"about_ca_system_score_gemma":0.00016983337,"threshold_uncertainty_score":0.9999456},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89300144,0.00041260567,0.09061366,0.010007724,0.0010115954,0.0005806979,0.00014667044,0.00009194551,0.0041336776],"genre_scores_gemma":[0.9935115,0.0000110496485,0.004228915,0.000655658,0.00018705663,0.000057898484,0.000028727194,0.000022364653,0.0012968539],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99825907,0.000064845095,0.00043907258,0.0002681596,0.0005765711,0.00039229228],"domain_scores_gemma":[0.9960436,0.0031401997,0.00012307329,0.0003942205,0.00019989623,0.00009898321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090566586,0.00018046364,0.0001968118,0.00022997026,0.00047365925,0.00015522065,0.0005096713,0.000062458406,0.00008573219],"category_scores_gemma":[0.0020339529,0.00010388046,0.000094317016,0.0017247103,0.000117087344,0.00012373371,0.00016915417,0.0004244421,0.00009679606],"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.000037595488,0.00009443266,0.0017517089,0.000068771704,0.0000406201,0.0000072387493,0.0010992544,0.007197004,0.00001869492,0.97894335,0.0073077576,0.0034335866],"study_design_scores_gemma":[0.0006239607,0.00008388171,0.040138837,0.000118619144,0.00002933267,0.00002138956,0.0023583544,0.02515733,0.00008395559,0.87271726,0.05811681,0.00055024755],"about_ca_topic_score_codex":0.00005074525,"about_ca_topic_score_gemma":0.00045657,"teacher_disagreement_score":0.10622605,"about_ca_system_score_codex":0.000033891563,"about_ca_system_score_gemma":0.00008367387,"threshold_uncertainty_score":0.42361224},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.981735,0.0002546153,0.0091198925,0.0000087455255,0.0001826685,0.00009465061,0.00009093849,0.00016094025,0.008352556],"genre_scores_gemma":[0.9984547,0.000007748094,0.0011679798,0.000014645477,0.000059242193,0.000007883826,0.000105656865,0.000016667022,0.00016548876],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992084,0.000028735156,0.00026257482,0.00013077636,0.00021621575,0.00015328391],"domain_scores_gemma":[0.99964213,0.00009595605,0.000033886743,0.00012720838,0.00004274886,0.000058078025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011369121,0.00011949154,0.00016863887,0.00012871406,0.000049098722,0.0000132112755,0.000119799,0.000048350674,0.00075791875],"category_scores_gemma":[0.000007235377,0.00011658941,0.00009063273,0.00042448187,0.000050943883,0.00011256975,0.0000100807765,0.00008453584,0.00013648355],"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.00004044314,0.00004601869,0.00603663,0.00015808987,0.00012861272,0.000003958103,0.0003362796,0.9722241,0.00078596623,0.013221103,0.0005413476,0.006477432],"study_design_scores_gemma":[0.0023051251,0.00017786156,0.27386457,0.0002215351,0.00007750532,0.000055503704,0.0006295171,0.6624732,0.0045550154,0.026567755,0.027957868,0.001114569],"about_ca_topic_score_codex":0.000012968448,"about_ca_topic_score_gemma":0.0000012527618,"teacher_disagreement_score":0.30975094,"about_ca_system_score_codex":0.000014364526,"about_ca_system_score_gemma":0.000007137701,"threshold_uncertainty_score":0.8298679},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026170589,0.00020279954,0.96985304,0.001813125,0.0003033278,0.00015029286,0.0000068392183,0.000056032168,0.0014439428],"genre_scores_gemma":[0.40037206,0.000006370814,0.59904295,0.0002679933,0.000063735315,0.00001888928,0.0000059910285,0.00000772598,0.00021428974],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867797,0.00010256986,0.00031099268,0.0002653894,0.0003673801,0.00027572847],"domain_scores_gemma":[0.9983601,0.0008713988,0.00014281351,0.0003121709,0.00020295432,0.00011058113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030693205,0.00012579178,0.0001643105,0.000093032075,0.00020045412,0.00017895015,0.0008528903,0.000035473222,0.000044586344],"category_scores_gemma":[0.00011485806,0.000082956234,0.00011451674,0.0007397811,0.00014238118,0.00023072686,0.0002903227,0.00013342955,0.0000963048],"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.000004824829,0.00006688078,0.0015023162,0.000013685007,0.000057472353,0.000003226956,0.00012188376,0.0052063465,0.00017588121,0.29739055,0.0006317918,0.6948252],"study_design_scores_gemma":[0.00028439908,0.00013899688,0.13124777,0.000015185084,0.0000064975197,0.000014301318,0.000058448175,0.42289963,0.00021889078,0.44180134,0.0030759997,0.00023854476],"about_ca_topic_score_codex":0.00006134373,"about_ca_topic_score_gemma":5.496839e-7,"teacher_disagreement_score":0.69458663,"about_ca_system_score_codex":0.000015361471,"about_ca_system_score_gemma":0.00005512638,"threshold_uncertainty_score":0.33828568},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3400151,0.00034206882,0.65681636,0.000901814,0.00042371886,0.00020223281,0.000044011245,0.00011394609,0.0011406954],"genre_scores_gemma":[0.94395244,0.000031758136,0.05417444,0.00043085072,0.00024557335,0.000019812749,0.00046984773,0.000017617145,0.0006576272],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997271,0.00012164921,0.0006712968,0.0006028103,0.0009693928,0.00036383484],"domain_scores_gemma":[0.99833196,0.0003543244,0.00030345438,0.0004117756,0.0003979751,0.00020050592],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041249447,0.0002802059,0.0003391327,0.0007331921,0.0001846225,0.00010936552,0.0006856067,0.000093267685,0.00011278909],"category_scores_gemma":[0.000112820635,0.0002781015,0.00020274988,0.0023698693,0.00008196704,0.0007796745,0.0003757518,0.00017643468,0.00009806072],"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.00013255788,0.00042277557,0.0077546504,0.00008718013,0.00021353668,0.00009086523,0.0005614457,0.84460104,0.0016654447,0.039984677,0.0026652652,0.10182056],"study_design_scores_gemma":[0.0014626135,0.0005350253,0.15548047,0.000093225,0.00003246415,0.00014128274,0.00007122123,0.81023645,0.0010853687,0.026148733,0.0041067842,0.0006063641],"about_ca_topic_score_codex":0.000016473305,"about_ca_topic_score_gemma":0.00000412731,"teacher_disagreement_score":0.6039373,"about_ca_system_score_codex":0.00007618452,"about_ca_system_score_gemma":0.00021703485,"threshold_uncertainty_score":0.9999671},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32098374,0.00008784315,0.6775479,0.0006528552,0.00007984243,0.0002121162,0.000051645522,0.000037838287,0.00034624216],"genre_scores_gemma":[0.7841117,0.0000031131128,0.21548834,0.00018725033,0.00002336915,0.0000035833878,0.00015256197,0.000006281685,0.000023807119],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983564,0.000044161916,0.00039803662,0.00036898977,0.00061209546,0.00022033793],"domain_scores_gemma":[0.99852705,0.0003854979,0.0003078745,0.00021477617,0.00047070353,0.00009408026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002519842,0.0001710628,0.00028487074,0.0005630005,0.00011373385,0.000049262493,0.00045135088,0.00005747078,0.000011107244],"category_scores_gemma":[0.000047598514,0.00016389515,0.000119794175,0.0012271528,0.000078900615,0.0005778644,0.00004145953,0.000078148674,0.0000026296823],"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.00029236244,0.000326016,0.0015128363,0.00011507072,0.0001873222,0.0000050736517,0.0007900565,0.1418076,0.0012849224,0.8343402,0.00035155652,0.018986987],"study_design_scores_gemma":[0.0039065112,0.0027707547,0.21366191,0.0002343953,0.000115186565,0.000034447377,0.00021035192,0.33887514,0.008953794,0.4299712,0.0005220644,0.00074426155],"about_ca_topic_score_codex":0.000012183667,"about_ca_topic_score_gemma":0.0000024766268,"teacher_disagreement_score":0.46312794,"about_ca_system_score_codex":0.000027544613,"about_ca_system_score_gemma":0.00016514554,"threshold_uncertainty_score":0.66834503},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18704653,0.0003005449,0.8018219,0.0019505816,0.00044481384,0.00028567872,0.000033382657,0.0002750593,0.007841528],"genre_scores_gemma":[0.8244002,0.000013865804,0.16827238,0.0027375673,0.0003253194,0.000040745264,0.00024025424,0.000023782783,0.003945918],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996807,0.00011391197,0.0005319182,0.00083243375,0.0009601374,0.00075461896],"domain_scores_gemma":[0.99845064,0.00028698027,0.00009096247,0.00048745796,0.00028787352,0.00039608777],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0005717736,0.0003081118,0.00029066333,0.00064349966,0.00070184976,0.00050593814,0.0009080007,0.00009029847,0.00095499156],"category_scores_gemma":[0.000079207086,0.00031751517,0.00016204534,0.0028230275,0.00003837011,0.00090542994,0.00038214572,0.0001926563,0.0013273371],"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.000017784994,0.00009594368,0.00043074627,0.000011235398,0.000043640062,0.00001469516,0.00032583272,0.8327644,0.00037784787,0.056873087,0.010919452,0.09812533],"study_design_scores_gemma":[0.0011314496,0.00031182947,0.04924025,0.00007276644,0.000027482041,0.000108068365,0.000046075613,0.80843604,0.0007778331,0.043942455,0.09476218,0.0011435957],"about_ca_topic_score_codex":0.000040712177,"about_ca_topic_score_gemma":0.0000059566846,"teacher_disagreement_score":0.63735366,"about_ca_system_score_codex":0.000099522105,"about_ca_system_score_gemma":0.00018721425,"threshold_uncertainty_score":0.9999583},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44096297,0.00035589674,0.55527246,0.0023552952,0.0003018118,0.00020840438,0.000017265775,0.000069523274,0.00045640225],"genre_scores_gemma":[0.915013,0.000007745765,0.083723925,0.0004388103,0.00014212079,0.000016903758,0.00009547238,0.000010813328,0.0005511891],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99774206,0.00008128108,0.00041395167,0.0006835742,0.0006898204,0.00038933303],"domain_scores_gemma":[0.99861115,0.00052490603,0.00011910595,0.0002903976,0.00021245219,0.00024200656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000928362,0.00022080516,0.00023270227,0.00069884723,0.00024151981,0.00023487413,0.0003806197,0.00007108398,0.000032573418],"category_scores_gemma":[0.0001753354,0.00022728379,0.00006598316,0.0020448584,0.00007899831,0.0007530706,0.00035444752,0.0001794834,0.000026310636],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015408163,0.0003954359,0.0718216,0.00007782115,0.00008722465,0.00006163366,0.0018460981,0.511542,0.0006483193,0.3321829,0.0034477678,0.07773512],"study_design_scores_gemma":[0.00057565846,0.00010686197,0.82365626,0.000054827928,0.000007848594,0.00004636207,0.00016928535,0.13441171,0.00039204943,0.033634514,0.0064994483,0.0004451894],"about_ca_topic_score_codex":0.00007505805,"about_ca_topic_score_gemma":0.00013373839,"teacher_disagreement_score":0.75183463,"about_ca_system_score_codex":0.00010169522,"about_ca_system_score_gemma":0.00009159709,"threshold_uncertainty_score":0.9268364},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008298949,0.00005824429,0.98860407,0.00031837565,0.00015123474,0.00055170944,0.000015179799,0.0003173242,0.0016849047],"genre_scores_gemma":[0.25693128,3.5934477e-7,0.7424083,0.0002372971,0.00006624812,0.0001473774,0.00010366551,0.000019593106,0.00008590208],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99762607,0.00009771144,0.00036228276,0.0007136411,0.0007717464,0.0004285504],"domain_scores_gemma":[0.99867016,0.00020433636,0.00016908013,0.0004505728,0.00025784035,0.00024800617],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043121225,0.00026318867,0.00023052542,0.00050367985,0.00033109818,0.00027668523,0.00057889766,0.00007915613,0.000013019896],"category_scores_gemma":[0.00006813382,0.0002496397,0.00006030251,0.0019093498,0.00004992712,0.00060446543,0.000101015896,0.000208862,0.00016937648],"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.000005152493,0.00005777166,0.0010346898,0.0000135548435,0.00002995034,0.000011324994,0.0005764054,0.94878805,0.00002755604,0.04126287,0.00013605751,0.00805662],"study_design_scores_gemma":[0.0005537469,0.00016922862,0.015794432,0.000054031538,0.000015697358,0.00016752644,0.00021523001,0.97649276,0.00019454402,0.0049833665,0.0008706404,0.00048877805],"about_ca_topic_score_codex":0.0000051553434,"about_ca_topic_score_gemma":8.869498e-8,"teacher_disagreement_score":0.24863233,"about_ca_system_score_codex":0.000106302185,"about_ca_system_score_gemma":0.00012148604,"threshold_uncertainty_score":0.9999956},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9555899,0.00018786042,0.042810224,0.00027142593,0.000052416122,0.0000968502,0.000015011905,0.0001483274,0.0008279894],"genre_scores_gemma":[0.99646926,0.000026359075,0.00280483,0.00017877884,0.000037061727,0.0000027209155,0.0004525559,0.0000102411095,0.000018212817],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936116,0.000012834794,0.0001635061,0.00016111095,0.00017181473,0.00012958664],"domain_scores_gemma":[0.99969405,0.000046028996,0.000049298797,0.000060592105,0.00008927128,0.00006078386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000038937484,0.00013754598,0.0001660854,0.0001774596,0.0000869763,0.00011457012,0.00004370073,0.000042081825,0.00007722843],"category_scores_gemma":[0.00000995853,0.00011312118,0.00002912249,0.00041580066,0.000032556487,0.00022744168,0.0000048741417,0.00007570003,0.0000045908037],"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.000050932966,0.0000126610585,0.00752289,0.00004551471,0.00020169342,0.0000094894,0.0005596303,0.9524124,0.0070595606,0.019301975,0.00011656443,0.012706638],"study_design_scores_gemma":[0.00047950892,0.00008146045,0.45460153,0.000031548363,0.000043417636,0.000019253854,0.00015023336,0.54107696,0.0009388939,0.0021911366,0.00010693392,0.0002791316],"about_ca_topic_score_codex":0.000006870678,"about_ca_topic_score_gemma":0.000002260658,"teacher_disagreement_score":0.44707865,"about_ca_system_score_codex":0.000015295107,"about_ca_system_score_gemma":0.0000075189946,"threshold_uncertainty_score":0.4612948},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9644404,0.002924263,0.02706685,0.000111370005,0.00014634916,0.00019475321,0.00019152649,0.000049321086,0.004875161],"genre_scores_gemma":[0.9936211,0.00017278387,0.005585428,0.000104229046,0.000044964636,0.000006936326,0.000044801473,0.00002590883,0.0003938352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977624,0.000064684245,0.00081840344,0.0002976472,0.0007661994,0.00029068565],"domain_scores_gemma":[0.99632454,0.0023511786,0.00049165875,0.0002135342,0.0005131181,0.00010595267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040811815,0.0002487935,0.0007377636,0.001400918,0.00012449526,0.00001780777,0.00022757979,0.00012619038,0.00014870045],"category_scores_gemma":[0.0014338063,0.00022528009,0.00014784305,0.001738492,0.00043852467,0.00022344856,0.00016574997,0.0001721368,0.0000065077493],"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.00025584968,0.00059496576,0.22269942,0.0036710287,0.0009071986,0.000033906425,0.003210478,0.0009659698,0.000114757866,0.75759995,0.003163605,0.006782876],"study_design_scores_gemma":[0.0031230145,0.00070007355,0.41355008,0.0003426894,0.00018828064,0.00020748281,0.0035415215,0.011418536,0.002886379,0.56241524,0.0006756194,0.0009510998],"about_ca_topic_score_codex":0.00010115846,"about_ca_topic_score_gemma":0.000002002171,"teacher_disagreement_score":0.19518472,"about_ca_system_score_codex":0.00002506295,"about_ca_system_score_gemma":0.00012883186,"threshold_uncertainty_score":0.9186655},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9888144,0.00044253253,0.0073379264,0.0015510727,0.00030312696,0.000300094,0.00009087816,0.00007218213,0.0010877796],"genre_scores_gemma":[0.9973247,0.000016507925,0.0013271321,0.00058587076,0.00015024676,0.000025272544,0.00009708542,0.000016365368,0.00045681943],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99841577,0.00011576028,0.0002670847,0.00033358825,0.00058007793,0.00028772565],"domain_scores_gemma":[0.9992701,0.00012688104,0.000128539,0.00020095841,0.00019036078,0.000083197956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021664628,0.00019643702,0.00018774383,0.000068822505,0.00072615244,0.000103613456,0.00027179555,0.00007052171,0.00068474875],"category_scores_gemma":[0.000091077316,0.0000961204,0.00009460644,0.00021823405,0.00038769355,0.00035950233,0.00012255102,0.00018542008,0.00017082073],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002880265,0.00080818695,0.024387049,0.00044077606,0.0005851693,0.0006917447,0.03069888,0.58272165,0.25452754,0.042197045,0.03750386,0.02255786],"study_design_scores_gemma":[0.0034173224,0.0008349213,0.73137987,0.00023238217,0.00016048053,0.0023788929,0.0034450109,0.058260284,0.07099709,0.080088995,0.046224665,0.002580118],"about_ca_topic_score_codex":0.00020897,"about_ca_topic_score_gemma":0.000015139596,"teacher_disagreement_score":0.7069928,"about_ca_system_score_codex":0.00007117438,"about_ca_system_score_gemma":0.000093621034,"threshold_uncertainty_score":0.74975187},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7508706,0.0008355101,0.24078812,0.0000635899,0.0006832525,0.00007650953,0.000023045803,0.00024339696,0.0064159725],"genre_scores_gemma":[0.9876841,0.000014513375,0.011710444,0.00008374045,0.00008453477,0.0000034986938,0.0001618294,0.000019663044,0.00023768516],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919814,0.000019718162,0.00020574148,0.00015381225,0.00024401785,0.00017854518],"domain_scores_gemma":[0.99969727,0.00007009282,0.000025538935,0.00008219753,0.000057061523,0.000067838926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007505699,0.00013442218,0.00013940106,0.00018070493,0.00009345117,0.000060637696,0.00007931846,0.00005157357,0.0005622067],"category_scores_gemma":[0.00003665178,0.00012515404,0.000101781276,0.00052309653,0.000021211312,0.00013818631,0.0000113919305,0.000106078114,0.00005432443],"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":[8.278013e-7,0.0000027930084,0.0030618154,0.000010454071,0.00006587524,0.0000016930384,0.000046535348,0.990397,0.000104075974,0.0045024185,0.00030241825,0.0015040893],"study_design_scores_gemma":[0.00044283504,0.00001707358,0.07126084,0.000020612397,0.000051374052,0.000020402578,0.00012549484,0.9169537,0.0008108798,0.007327325,0.0025493903,0.00042009953],"about_ca_topic_score_codex":0.0000028964284,"about_ca_topic_score_gemma":5.1177494e-7,"teacher_disagreement_score":0.23681349,"about_ca_system_score_codex":0.00003307069,"about_ca_system_score_gemma":0.000013163785,"threshold_uncertainty_score":0.6155769},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53524166,0.0009974395,0.46319976,0.00028371968,0.000060393824,0.00010207297,0.0000033069152,0.000017709224,0.00009392543],"genre_scores_gemma":[0.943967,0.000029170578,0.05568005,0.00020312073,0.000073051895,0.0000019429256,0.000021174517,0.000007233175,0.000017266202],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9985252,0.000082291495,0.00043319963,0.00037939838,0.00034921875,0.00023070017],"domain_scores_gemma":[0.99851626,0.0009820642,0.00017437224,0.00013418988,0.000105147185,0.00008797925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010484578,0.00016181207,0.00020538144,0.00040974465,0.00022527014,0.00014382285,0.00018652588,0.000056201567,0.00000246009],"category_scores_gemma":[0.00009806485,0.00013721694,0.00002875738,0.0007533108,0.00014303585,0.00035008934,0.00027278042,0.00015716984,8.192479e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051789804,0.000100087076,0.14806476,0.00010343995,0.00008267302,0.000030815867,0.0049546207,0.2808716,0.0011933424,0.15481386,0.00007927535,0.40965375],"study_design_scores_gemma":[0.00034448315,0.000043904398,0.56817514,0.000032629403,0.0000062183035,0.000043614724,0.00019011063,0.42544606,0.00009878838,0.005428741,0.00007216898,0.00011812761],"about_ca_topic_score_codex":0.000045765813,"about_ca_topic_score_gemma":0.00003571593,"teacher_disagreement_score":0.4201104,"about_ca_system_score_codex":0.000019865467,"about_ca_system_score_gemma":0.00005314024,"threshold_uncertainty_score":0.5595544},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01467057,0.0011675673,0.974384,0.005301312,0.00061703654,0.00019395733,0.00001530807,0.00021798255,0.003432281],"genre_scores_gemma":[0.96226496,0.00003821137,0.035040937,0.0016176344,0.00023736892,0.0000120865625,0.00014534417,0.000008430885,0.00063504104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977806,0.00009423598,0.0004142747,0.000498491,0.00081134547,0.0004010393],"domain_scores_gemma":[0.99845034,0.000553248,0.00016907806,0.00042599754,0.0002510689,0.0001502917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046885238,0.0002241462,0.00017269728,0.00026040417,0.000804659,0.00050478196,0.0009547102,0.000062244966,0.000018629762],"category_scores_gemma":[0.00009684506,0.000176448,0.00013731135,0.0017029869,0.000079890815,0.0005523153,0.00010383738,0.00020593267,0.00011335006],"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.000024456334,0.00006295851,0.00021363997,0.0000047833705,0.000032712072,0.000013290642,0.00012437861,0.1403896,0.0000665748,0.76097023,0.0056265965,0.09247076],"study_design_scores_gemma":[0.00075924536,0.00027385287,0.11149573,0.000026111999,0.000013093286,0.00008852029,0.000045717563,0.31864512,0.00024168655,0.51567286,0.052147385,0.0005906645],"about_ca_topic_score_codex":0.00000468392,"about_ca_topic_score_gemma":0.0000038694398,"teacher_disagreement_score":0.9475944,"about_ca_system_score_codex":0.000052510877,"about_ca_system_score_gemma":0.00012221432,"threshold_uncertainty_score":0.71953404},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050606173,0.0003053048,0.9446812,0.001994276,0.0010567056,0.00048832985,0.000079478436,0.00028947584,0.0004990509],"genre_scores_gemma":[0.5559466,0.0000030796737,0.44202346,0.00089313736,0.0006455305,0.000015578036,0.00024588022,0.00001969942,0.00020708315],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99674064,0.000095678915,0.0007077952,0.0009085795,0.00095941225,0.0005879146],"domain_scores_gemma":[0.99666256,0.0015621776,0.0002854456,0.00037514372,0.00087238074,0.00024227142],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00073497783,0.00037562178,0.000383797,0.0006476085,0.0012024274,0.0011856937,0.00068909954,0.0001351043,0.000025238858],"category_scores_gemma":[0.00036469096,0.00038544938,0.00026998436,0.0013267668,0.00016307054,0.0011118165,0.00036368895,0.00023264866,0.00014904857],"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.000045154095,0.00009357716,0.0001442458,0.000017800288,0.00006751285,0.000006709519,0.00057657575,0.54455614,0.00003713194,0.09562431,0.0030247695,0.35580608],"study_design_scores_gemma":[0.0010781208,0.00016061119,0.014920837,0.000041978987,0.000018028928,0.000062015475,0.000063474596,0.9188315,0.00035160038,0.028691465,0.03529747,0.0004828926],"about_ca_topic_score_codex":0.000014763491,"about_ca_topic_score_gemma":0.00000884742,"teacher_disagreement_score":0.5053404,"about_ca_system_score_codex":0.00017755726,"about_ca_system_score_gemma":0.00041082953,"threshold_uncertainty_score":0.99985975},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17774913,0.000031451465,0.8148491,0.0009237871,0.000076182216,0.0003117213,0.000311981,0.000105830375,0.0056408397],"genre_scores_gemma":[0.8499228,0.0000021557266,0.14900298,0.00013869518,0.000023091341,0.000016692049,0.00078649627,0.000020143034,0.00008698015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982368,0.000043261392,0.00065761444,0.0002528421,0.0005969058,0.00021261077],"domain_scores_gemma":[0.998722,0.00038625984,0.00030568973,0.00022432316,0.0002542742,0.000107444954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002809451,0.00020059216,0.0003311849,0.00015345817,0.000090101006,0.000037865026,0.0001890684,0.00008876961,0.00046419108],"category_scores_gemma":[0.00044499632,0.0001702411,0.00013970332,0.0005044678,0.000100568024,0.00018786947,0.00003247479,0.00015405568,0.00011336946],"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.000033579345,0.00023905159,0.00010502848,0.00025135436,0.00005276246,0.0000037784903,0.0003935514,0.0029732478,0.000057702677,0.9936943,0.0019181411,0.0002775044],"study_design_scores_gemma":[0.00080355286,0.00007236871,0.0018651119,0.00015761882,0.000026271373,0.000015737207,0.00031200759,0.019789489,0.00084835745,0.9755613,0.00033555034,0.00021264238],"about_ca_topic_score_codex":0.000012497197,"about_ca_topic_score_gemma":0.000005466006,"teacher_disagreement_score":0.6721736,"about_ca_system_score_codex":0.000096917654,"about_ca_system_score_gemma":0.00006826227,"threshold_uncertainty_score":0.69422305},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22364311,0.0005106842,0.774095,0.00025793817,0.00017340391,0.0001724493,0.000009233651,0.00014799951,0.0009902084],"genre_scores_gemma":[0.8356196,0.000019024983,0.16380505,0.0003610163,0.00003484578,0.00000847861,0.000023742401,0.000017888338,0.00011035294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99720436,0.00010305743,0.00038523375,0.00069516996,0.00094836694,0.0006638002],"domain_scores_gemma":[0.997148,0.0017181748,0.00013129474,0.0004492708,0.00022560303,0.00032768882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014875022,0.00024736125,0.00026068595,0.0021042118,0.00030067016,0.00022841925,0.000873816,0.000095594725,0.000018656077],"category_scores_gemma":[0.0002728806,0.00023357348,0.00011666234,0.0055137086,0.00030196228,0.00075061346,0.0004477109,0.00034533546,0.00004548696],"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.00012166849,0.00017763511,0.03602981,0.00007903038,0.00017828039,0.00016978054,0.0005857064,0.034380138,0.0001848016,0.6311395,0.0002991843,0.29665443],"study_design_scores_gemma":[0.0012258899,0.0002838095,0.39432025,0.000035168792,0.000015280933,0.0001916967,0.00020327426,0.034020144,0.00043580946,0.5677725,0.00074978604,0.00074640336],"about_ca_topic_score_codex":0.00001640411,"about_ca_topic_score_gemma":0.0000044615936,"teacher_disagreement_score":0.6119765,"about_ca_system_score_codex":0.000053622345,"about_ca_system_score_gemma":0.00005831733,"threshold_uncertainty_score":0.952485},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08329514,0.00028309325,0.91181815,0.0024525153,0.00057832914,0.00047671798,0.00010044375,0.00030941173,0.00068623305],"genre_scores_gemma":[0.777102,0.000009116568,0.2204607,0.0012663605,0.00027099584,0.000035285277,0.0006195717,0.000015448171,0.00022054577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973982,0.000076105156,0.0005037196,0.0007699732,0.0007670038,0.0004850022],"domain_scores_gemma":[0.9984001,0.000499017,0.00019944612,0.00034814872,0.00036342873,0.00018984351],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040198484,0.00034939562,0.00032657254,0.0004939637,0.0004525904,0.00039984728,0.0006284631,0.00010707005,0.000025272539],"category_scores_gemma":[0.00008369046,0.00033055764,0.00019845826,0.0012693678,0.0000623309,0.0007433921,0.00008655916,0.00017097346,0.000040195104],"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.00010595433,0.0003598758,0.0002662042,0.000022830309,0.00008021801,0.00001808674,0.00032563243,0.38876978,0.00034585572,0.4957277,0.0021745916,0.11180331],"study_design_scores_gemma":[0.0007156544,0.0006349743,0.024502374,0.0000302404,0.000012917341,0.000025777634,0.000029642446,0.86759126,0.0006169261,0.10350938,0.0018726097,0.00045824336],"about_ca_topic_score_codex":0.0000059131735,"about_ca_topic_score_gemma":9.544748e-7,"teacher_disagreement_score":0.6938068,"about_ca_system_score_codex":0.00007741091,"about_ca_system_score_gemma":0.00016109487,"threshold_uncertainty_score":0.99991465},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057258062,0.00029114884,0.9401873,0.00037751344,0.0007908574,0.00047069555,0.00009903681,0.00009737421,0.00042801813],"genre_scores_gemma":[0.71333545,0.0000034992643,0.2854778,0.00013834477,0.00034736923,0.00006132437,0.00053637155,0.000014003606,0.00008585753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976764,0.00010269696,0.00058743573,0.00041077094,0.00079442473,0.00042828688],"domain_scores_gemma":[0.9981891,0.0005259772,0.00033822315,0.0003035757,0.00045599465,0.00018714409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010389249,0.0002331537,0.00028064178,0.0005396499,0.00019753608,0.0001034493,0.000517706,0.00011124388,0.000037926267],"category_scores_gemma":[0.00014539271,0.00023557997,0.00019187115,0.0011008914,0.00005392835,0.0011208394,0.00019510994,0.00012957712,0.000034718443],"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.00007590061,0.00044615322,0.004295509,0.00026272843,0.00023534145,0.0000017712946,0.0019196062,0.34869173,0.0013061905,0.45431253,0.0021805384,0.18627201],"study_design_scores_gemma":[0.001134962,0.00017153686,0.03629968,0.000029297156,0.00003353482,0.000042029456,0.00012146624,0.8761309,0.0029537163,0.080277115,0.0023388292,0.0004669389],"about_ca_topic_score_codex":0.00000891499,"about_ca_topic_score_gemma":6.1697176e-7,"teacher_disagreement_score":0.6560774,"about_ca_system_score_codex":0.00007647603,"about_ca_system_score_gemma":0.00012610329,"threshold_uncertainty_score":0.9606672},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058838524,0.0002803628,0.93751186,0.00035413358,0.0007971075,0.00048158795,0.00004243202,0.00026030463,0.0014336902],"genre_scores_gemma":[0.67295647,0.000006353452,0.3255861,0.0006066659,0.00021596524,0.000089731555,0.0002480853,0.000018943963,0.00027167055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973693,0.00008711159,0.0006032343,0.0007709532,0.0007071599,0.00046228015],"domain_scores_gemma":[0.99805874,0.00043841437,0.00027283025,0.00043327885,0.0005927487,0.00020396327],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006368966,0.0003070738,0.00028378176,0.00077856105,0.00043189467,0.0002451678,0.00085537357,0.00012309942,0.00013505825],"category_scores_gemma":[0.00022085501,0.00032159218,0.00021587957,0.0017316609,0.000071253926,0.0013767048,0.00023819879,0.00017361932,0.00016797769],"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.00010976992,0.0003108701,0.0030814144,0.000100589124,0.0001545002,0.000016493186,0.0013090136,0.09065184,0.0008958572,0.8452475,0.0035923251,0.054529853],"study_design_scores_gemma":[0.0014180307,0.0005182626,0.07986579,0.000045973422,0.00004350818,0.00010589046,0.000091180504,0.65404886,0.0037264004,0.25398302,0.0051627373,0.0009903385],"about_ca_topic_score_codex":0.000023132536,"about_ca_topic_score_gemma":0.0000040327745,"teacher_disagreement_score":0.6141179,"about_ca_system_score_codex":0.00009409517,"about_ca_system_score_gemma":0.00021535116,"threshold_uncertainty_score":0.9999236},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2733955,0.0001612249,0.71849084,0.006825,0.00027784554,0.00028354515,0.000026942136,0.000106444495,0.0004326506],"genre_scores_gemma":[0.7798781,0.0000015968318,0.21764775,0.0018451511,0.00021980886,0.000025372312,0.0001144361,0.000013951526,0.00025383593],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973672,0.000074890886,0.0005222181,0.00068703486,0.00091705093,0.0004315902],"domain_scores_gemma":[0.9988459,0.00028955308,0.00010065577,0.0002962731,0.00021314915,0.00025448407],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004785049,0.00026536355,0.00026603718,0.0009309471,0.00015465057,0.00015559424,0.0005869691,0.00008523859,0.0001234184],"category_scores_gemma":[0.00007000923,0.00027927136,0.00011615783,0.0023106432,0.00003448353,0.0007516746,0.00021419874,0.00020417022,0.00044520915],"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.000026077156,0.00013372462,0.0009248845,0.000007633086,0.000021812468,0.000010951533,0.00018875043,0.9454609,0.00031247566,0.025501056,0.00069485774,0.026716856],"study_design_scores_gemma":[0.0011261757,0.00016372793,0.061286643,0.00004584041,0.0000071460136,0.000027570586,0.00001139591,0.9179916,0.0008006652,0.013453452,0.00462335,0.00046245783],"about_ca_topic_score_codex":0.000033284672,"about_ca_topic_score_gemma":0.000091239046,"teacher_disagreement_score":0.5064826,"about_ca_system_score_codex":0.00016011974,"about_ca_system_score_gemma":0.00017361407,"threshold_uncertainty_score":0.99996597},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37383875,0.000051056,0.6184417,0.0022092473,0.0002934619,0.00012092712,0.000009182741,0.00006349668,0.004972174],"genre_scores_gemma":[0.97778636,0.00000971326,0.020324182,0.0012039029,0.0001387626,0.000015324718,0.000057358004,0.000008810317,0.00045556398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837047,0.0000919447,0.00034735497,0.0003295906,0.000653275,0.0002073446],"domain_scores_gemma":[0.9981363,0.0010053447,0.00017003856,0.0003316934,0.00028827877,0.000068334906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033880016,0.00016102537,0.00017118288,0.0001875207,0.00018481881,0.00009178037,0.00061506603,0.0000488277,0.00023740808],"category_scores_gemma":[0.0001776072,0.000118476695,0.00012044272,0.0015536202,0.00006763334,0.00026429954,0.00013482479,0.00013476211,0.00019344976],"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.000023661563,0.00009104499,0.0031521127,0.000008023521,0.00003963826,0.00000573712,0.00011097569,0.230556,0.00011236772,0.75492054,0.001929551,0.009050357],"study_design_scores_gemma":[0.00066123746,0.000116209354,0.09746294,0.00004910491,0.000011609158,0.00008680745,0.000042602085,0.5849122,0.0006414329,0.31142125,0.0042289826,0.0003656808],"about_ca_topic_score_codex":0.0000073383367,"about_ca_topic_score_gemma":7.133797e-7,"teacher_disagreement_score":0.60394764,"about_ca_system_score_codex":0.000025663343,"about_ca_system_score_gemma":0.00008136596,"threshold_uncertainty_score":0.48313394},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03768156,0.000093138915,0.9590135,0.0015685147,0.0009163794,0.00018057405,0.00015606282,0.00016877364,0.0002214517],"genre_scores_gemma":[0.44537672,0.000004253065,0.5527633,0.00040358692,0.0003433378,0.000041820153,0.00061730127,0.0000104520705,0.0004392091],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815905,0.000046469508,0.00035686948,0.0006512889,0.000400544,0.00038579767],"domain_scores_gemma":[0.99848,0.00046010656,0.00016346028,0.000453221,0.00028318298,0.000159985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003868659,0.0001988846,0.0002966872,0.00065622287,0.00030922293,0.0001837827,0.0009408918,0.00013352427,0.00015363093],"category_scores_gemma":[0.00020711085,0.00017165198,0.00021909174,0.0019433202,0.0002031681,0.00045539733,0.0002655903,0.00024162293,0.0000864677],"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.000010516007,0.00018973734,0.000608234,0.000012804779,0.00015727198,0.000013097155,0.00006814477,0.004338244,0.00068326015,0.47317752,0.004524031,0.5162172],"study_design_scores_gemma":[0.000825994,0.00028899594,0.033867605,0.0000049690716,0.000054304885,0.00015652143,0.000057946232,0.5365965,0.0005145468,0.39171243,0.03535966,0.0005605799],"about_ca_topic_score_codex":0.000043727978,"about_ca_topic_score_gemma":0.0000049662967,"teacher_disagreement_score":0.5322582,"about_ca_system_score_codex":0.000021658072,"about_ca_system_score_gemma":0.000058459187,"threshold_uncertainty_score":0.69997644},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28787157,0.0005083783,0.7099874,0.0004062404,0.000441028,0.00021509978,0.00011641191,0.00009347421,0.00036040155],"genre_scores_gemma":[0.92898977,0.0000030105907,0.069396175,0.00044447483,0.000067873625,0.000006643716,0.0010599865,0.00001385958,0.000018231745],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969812,0.0001582838,0.00054529204,0.00091622496,0.0010395974,0.00035940215],"domain_scores_gemma":[0.99743444,0.0012089245,0.00019993147,0.0006220374,0.00023143529,0.00030321974],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00072083087,0.0003018865,0.00036337567,0.00160485,0.00014662763,0.00033517316,0.0010198961,0.000099572215,0.000019414476],"category_scores_gemma":[0.00055615796,0.00027877578,0.000047044305,0.0029674752,0.00010852722,0.0006458511,0.000472998,0.00028236414,0.000019662044],"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.000038831193,0.00016802139,0.027867412,0.00001923173,0.000037651866,0.000020109617,0.0002343955,0.8757489,0.0000072800826,0.07677892,0.0019841935,0.017095083],"study_design_scores_gemma":[0.0012438658,0.00019418112,0.09962072,0.000020131334,0.000008502606,0.000009872627,0.00010344353,0.86253834,0.00008129151,0.035223607,0.0006082224,0.00034785102],"about_ca_topic_score_codex":0.00006228208,"about_ca_topic_score_gemma":0.000012577046,"teacher_disagreement_score":0.64111817,"about_ca_system_score_codex":0.00011710083,"about_ca_system_score_gemma":0.00043377734,"threshold_uncertainty_score":0.99996644},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79928607,0.00025716014,0.19800834,0.000059506787,0.00006893541,0.00008279006,0.000026376838,0.00033380048,0.001877041],"genre_scores_gemma":[0.9844631,0.000014782327,0.0152545385,0.00007541721,0.000029893168,0.0000016959638,0.00013396876,0.000010297192,0.000016300623],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991179,0.000018744864,0.0002737135,0.00015321282,0.000276642,0.000159787],"domain_scores_gemma":[0.99952054,0.00007713476,0.000053634278,0.00019000462,0.00009419772,0.00006450294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006528457,0.00013295098,0.00026125932,0.0004681771,0.000046195022,0.00001657805,0.00012644536,0.000048123973,0.000039036022],"category_scores_gemma":[0.000010911556,0.00011671086,0.00017150403,0.00093915843,0.000035044206,0.000060173013,0.000028393635,0.000101831036,0.000009207468],"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.000006513827,0.000036840087,0.001673424,0.000004837626,0.00030175812,0.0000057396046,0.000057460627,0.9903407,0.0022003183,0.003069952,0.00044621722,0.0018562154],"study_design_scores_gemma":[0.00018160265,0.000060817005,0.26883656,0.000028846023,0.0002101161,0.0000050130116,0.000023201595,0.7194721,0.003912572,0.006431605,0.00059756543,0.00024001175],"about_ca_topic_score_codex":0.000009568117,"about_ca_topic_score_gemma":0.0000011315186,"teacher_disagreement_score":0.27086863,"about_ca_system_score_codex":0.000026401502,"about_ca_system_score_gemma":0.000009972267,"threshold_uncertainty_score":0.47593307},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23040101,0.0001342891,0.76393247,0.00221766,0.0014975939,0.00013734186,0.000012137737,0.0002941508,0.0013733497],"genre_scores_gemma":[0.7777908,0.0000040778586,0.21962938,0.0010648587,0.00076272385,0.000018283237,0.00017840618,0.000016221187,0.00053525274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997834,0.0000530903,0.0004559605,0.0006071188,0.0006926743,0.00035714536],"domain_scores_gemma":[0.998335,0.00041846762,0.00017541488,0.00040235158,0.00047456234,0.00019421309],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042889686,0.00025753432,0.00022485464,0.0005778394,0.00036679194,0.00038999825,0.00080126023,0.00011730473,0.00016914344],"category_scores_gemma":[0.0002491901,0.00025233382,0.00014732887,0.0016790704,0.000080007805,0.0008551704,0.0002940044,0.00038651464,0.00022609263],"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.000021826816,0.00020916256,0.003993916,0.000046154637,0.00009774153,0.000032300275,0.00042750043,0.3579524,0.00900138,0.4802225,0.0041744555,0.14382066],"study_design_scores_gemma":[0.0006650785,0.00009505472,0.061056685,0.000023000997,0.0000141870505,0.00012100679,0.000020863026,0.8458678,0.0017527874,0.05213491,0.037616894,0.00063170673],"about_ca_topic_score_codex":0.000016989932,"about_ca_topic_score_gemma":0.000008220081,"teacher_disagreement_score":0.5473898,"about_ca_system_score_codex":0.000021292797,"about_ca_system_score_gemma":0.00018128322,"threshold_uncertainty_score":0.9999929},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46904612,0.0007614229,0.5279433,0.0005715298,0.00014477334,0.00012997817,0.0000047133053,0.00007226948,0.0013258817],"genre_scores_gemma":[0.93752,0.0000120797595,0.06206089,0.00016696523,0.00006357287,0.0000117169575,0.000010746774,0.000011515977,0.00014248374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9984538,0.0000910631,0.00019902084,0.00032893853,0.0004430393,0.00048412182],"domain_scores_gemma":[0.9989572,0.00047520603,0.000059255595,0.00023070062,0.00007495254,0.00020266103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000600486,0.00014391339,0.00016507096,0.00050153746,0.00010710625,0.000108097636,0.0004432395,0.00005892633,0.000020196156],"category_scores_gemma":[0.00010051137,0.00014060146,0.000041779822,0.0012379516,0.00011384371,0.0010534383,0.00044773307,0.00023999825,0.000057180445],"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.000016418602,0.000046303692,0.09312791,0.000028981041,0.00001691521,0.000010648472,0.001351645,0.008326472,0.00018301087,0.88466626,0.00010580933,0.012119602],"study_design_scores_gemma":[0.001036629,0.00008575298,0.44101897,0.00006555864,0.000004671282,0.000077410936,0.00027715167,0.21194051,0.00044271676,0.34248132,0.001970542,0.00059874577],"about_ca_topic_score_codex":0.000008283357,"about_ca_topic_score_gemma":0.0000011829925,"teacher_disagreement_score":0.54218495,"about_ca_system_score_codex":0.00004746183,"about_ca_system_score_gemma":0.000032893142,"threshold_uncertainty_score":0.5733561},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90668654,0.00026985983,0.057760473,0.000031625677,0.00048610405,0.00012474589,0.000048351794,0.00036785853,0.03422445],"genre_scores_gemma":[0.9986066,9.1094444e-7,0.00065135845,0.000052411197,0.0002970498,0.000012645024,0.00018756642,0.000026988779,0.0001644569],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9991382,0.000025401914,0.00023723187,0.0001491804,0.00022179927,0.00022819787],"domain_scores_gemma":[0.99967164,0.000101148835,0.000029859038,0.00010252235,0.00004057779,0.000054246633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010581744,0.00014333107,0.00014978758,0.0001668562,0.00008853529,0.000048196864,0.00012578837,0.00006632694,0.00010520424],"category_scores_gemma":[0.000007122787,0.00014776074,0.00008933961,0.0004281311,0.000038943515,0.00009453733,0.000018152983,0.00010670322,0.000192854],"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.000009646681,0.000020825386,0.006778987,0.000036909776,0.000041557996,0.00000972049,0.000042116473,0.9018204,0.00033753618,0.08547826,0.004145501,0.0012784919],"study_design_scores_gemma":[0.0011853232,0.000087620385,0.50618273,0.000052699354,0.00004596832,0.00007226856,0.00022058273,0.2723418,0.00078761653,0.193867,0.024172693,0.0009837461],"about_ca_topic_score_codex":0.000023288338,"about_ca_topic_score_gemma":0.000013116248,"teacher_disagreement_score":0.6294787,"about_ca_system_score_codex":0.000032965534,"about_ca_system_score_gemma":0.000011694456,"threshold_uncertainty_score":0.6025508},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15033102,0.00013797106,0.843409,0.0019060235,0.00041167435,0.0006050387,0.00003288948,0.00029015297,0.00287623],"genre_scores_gemma":[0.67162174,0.000010510664,0.32452852,0.0014400111,0.0003493333,0.00010575779,0.0003238139,0.000032250173,0.0015880876],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99689794,0.00011811916,0.00055347173,0.00080236583,0.0011058192,0.00052226864],"domain_scores_gemma":[0.99737054,0.0004596942,0.00024228489,0.00047903546,0.0011443957,0.0003040381],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003317165,0.00037854016,0.000349549,0.00055005646,0.0004091028,0.00064629805,0.00082561834,0.000110192166,0.0005390699],"category_scores_gemma":[0.0001161764,0.00033082467,0.00013591666,0.0020944774,0.000120102224,0.0013131592,0.00026546727,0.00024984826,0.0025737458],"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.00010083744,0.00049570977,0.005366615,0.00011186221,0.00033719224,0.00006364785,0.00046202602,0.732261,0.00051087793,0.21353327,0.025318457,0.021438535],"study_design_scores_gemma":[0.001218636,0.00037921531,0.03961377,0.00004886418,0.000018804798,0.000087446904,0.000047241425,0.9306153,0.000321813,0.012444478,0.014538038,0.0006663759],"about_ca_topic_score_codex":0.000051719202,"about_ca_topic_score_gemma":0.0000036584984,"teacher_disagreement_score":0.5212907,"about_ca_system_score_codex":0.000093463226,"about_ca_system_score_gemma":0.0002794957,"threshold_uncertainty_score":0.9999144},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32288435,0.000040589955,0.67230684,0.0017848291,0.0005777218,0.00021174164,0.00001174228,0.000057474437,0.002124704],"genre_scores_gemma":[0.9655315,0.000001287774,0.03272269,0.0010781084,0.00026162085,0.000031456628,0.00026134268,0.00000901729,0.00010295487],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99810624,0.00008932002,0.0004054597,0.00043242043,0.0006553256,0.00031123575],"domain_scores_gemma":[0.9985674,0.000662141,0.00013022438,0.0003796302,0.00017588666,0.000084737585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007124178,0.00018946463,0.0001619429,0.00045078798,0.0005466112,0.0009182719,0.00087017025,0.000086266235,0.00006959342],"category_scores_gemma":[0.0001222603,0.00015544317,0.00008664278,0.0017516761,0.0001261084,0.0007195203,0.00010944948,0.0004662515,0.00010758465],"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.000025811341,0.0003877429,0.012297002,0.000041507086,0.000057269463,0.00011846481,0.004436169,0.43943805,0.0047545033,0.47926006,0.0026464367,0.05653699],"study_design_scores_gemma":[0.00062618754,0.00005524836,0.53447646,0.00001701242,0.0000071339464,0.00016769077,0.00009821023,0.4381902,0.0003282026,0.022644535,0.0030586931,0.00033044297],"about_ca_topic_score_codex":0.00003360867,"about_ca_topic_score_gemma":0.000077056495,"teacher_disagreement_score":0.6426472,"about_ca_system_score_codex":0.00002498165,"about_ca_system_score_gemma":0.0002467167,"threshold_uncertainty_score":0.8854917},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.601428,0.0004505184,0.39335817,0.0020243032,0.0015470469,0.00022581492,0.000013398698,0.00006907671,0.00088365824],"genre_scores_gemma":[0.9850719,0.000002079308,0.013817486,0.00048436274,0.00016273274,0.000008037416,0.000027319995,0.00000946414,0.0004166136],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99747574,0.00018228922,0.00046438648,0.00036690643,0.0012269743,0.0002836883],"domain_scores_gemma":[0.9975133,0.0007040596,0.00028978937,0.0004992343,0.00085302436,0.00014058826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010058391,0.00017751739,0.00017121685,0.00013148539,0.00064344384,0.0002803255,0.0010611676,0.00006310397,0.000007713781],"category_scores_gemma":[0.00044100243,0.00011202975,0.00016764838,0.0014094154,0.00023713295,0.00043241621,0.00065800146,0.00020013037,0.00003661185],"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.00003554635,0.00006394079,0.019698663,0.00001118192,0.00006377476,0.000003666072,0.00034042678,0.7490875,0.00014501196,0.21902543,0.0021601354,0.009364686],"study_design_scores_gemma":[0.0008339724,0.00008974568,0.36748254,0.000037655413,0.0000150690075,0.00007676142,0.00006216831,0.5118754,0.0019099306,0.113398865,0.003898774,0.00031911134],"about_ca_topic_score_codex":0.000024050929,"about_ca_topic_score_gemma":0.00000830917,"teacher_disagreement_score":0.3836439,"about_ca_system_score_codex":0.000075021344,"about_ca_system_score_gemma":0.00044616594,"threshold_uncertainty_score":0.4948915},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36436138,0.00018607253,0.6319524,0.00031679217,0.000578838,0.0008562023,0.00013755033,0.00026870158,0.001342045],"genre_scores_gemma":[0.7693091,0.000003757468,0.22909445,0.0001786809,0.0002739165,0.000078971476,0.00008123349,0.00006254898,0.0009173187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982458,0.00004138127,0.0005023445,0.00035152427,0.0004868253,0.00037214044],"domain_scores_gemma":[0.99642587,0.0026015947,0.0002752331,0.00029286597,0.00028138072,0.00012307875],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019212814,0.00028121067,0.0004915626,0.00018230033,0.0002827414,0.000035154822,0.00028563925,0.00012661798,0.00007867982],"category_scores_gemma":[0.0012887077,0.00025963367,0.00021313089,0.00038667824,0.00013262051,0.0001497475,0.000087245164,0.00017899305,0.000039528866],"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.00008170693,0.00021355718,0.00082187017,0.0002254111,0.00015958186,0.000028846789,0.0006434431,0.0016620598,0.00006227988,0.9858877,0.00930277,0.0009107885],"study_design_scores_gemma":[0.0018023963,0.000206126,0.00084664766,0.00005939722,0.00005479963,0.00014600733,0.00017858173,0.005754784,0.00023284192,0.98510456,0.005184106,0.00042977917],"about_ca_topic_score_codex":0.000003648514,"about_ca_topic_score_gemma":0.00000108734,"teacher_disagreement_score":0.40494776,"about_ca_system_score_codex":0.000070010996,"about_ca_system_score_gemma":0.00009918311,"threshold_uncertainty_score":0.9999856},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.830292,0.00024755052,0.1358724,0.0012658245,0.00018394593,0.00054385344,0.00006826433,0.00016186693,0.03136432],"genre_scores_gemma":[0.9110217,0.0000033644271,0.08779126,0.00013608525,0.00015433301,0.000049895625,0.00006427553,0.000032278218,0.0007468067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99849904,0.000045941673,0.00043301756,0.00021665002,0.000405686,0.00039969306],"domain_scores_gemma":[0.9985851,0.0007416848,0.00015925936,0.00028380848,0.000068448666,0.00016170485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051204505,0.00018714012,0.00025620588,0.00025605856,0.00010206126,0.000048477712,0.00022246237,0.000075884986,0.00045109412],"category_scores_gemma":[0.00021729975,0.00017469194,0.00009957027,0.0006258942,0.000054069584,0.00018801044,0.00009828986,0.00018135781,0.00026587266],"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.0000067053925,0.00042320575,0.011526813,0.000120453595,0.000042315834,0.0000021192682,0.0009879692,0.0009086326,0.00007293103,0.9733806,0.011785772,0.00074244454],"study_design_scores_gemma":[0.0011243016,0.0000452587,0.05385734,0.00014637069,0.000064009844,0.000055329103,0.00084299315,0.026414681,0.00023853127,0.8965417,0.01982444,0.00084502506],"about_ca_topic_score_codex":0.00001546307,"about_ca_topic_score_gemma":0.0000056947815,"teacher_disagreement_score":0.08072972,"about_ca_system_score_codex":0.000062102474,"about_ca_system_score_gemma":0.000035580644,"threshold_uncertainty_score":0.7123731},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56580526,0.00057941343,0.4293424,0.00085391855,0.00030644005,0.00021431882,0.000026324338,0.00009589788,0.0027760626],"genre_scores_gemma":[0.963079,0.000005529744,0.03603281,0.00014605295,0.00012733524,0.000027941698,0.00031039052,0.000015084486,0.00025589537],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99744123,0.00013840148,0.0006184644,0.00068938045,0.00066393375,0.00044857687],"domain_scores_gemma":[0.99889934,0.00044344564,0.00016596993,0.0002811317,0.00011964975,0.00009046764],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004580431,0.0002652769,0.0002897441,0.00089949527,0.00013139569,0.00022909812,0.0005679636,0.00008203623,0.000033449178],"category_scores_gemma":[0.00007721281,0.00028023854,0.00009877085,0.0028296183,0.00006740261,0.00058640866,0.00018682802,0.00021514695,0.00006105246],"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.00002334285,0.00022928092,0.056606323,0.000028389924,0.000010310083,0.00014972659,0.00017599543,0.78845066,0.00007277856,0.13998736,0.0005087667,0.013757049],"study_design_scores_gemma":[0.00068754656,0.00004697584,0.56412584,0.00003879649,0.00000289215,0.00003334319,0.000026119686,0.34294695,0.00007598884,0.09026404,0.0013950699,0.000356485],"about_ca_topic_score_codex":0.00028106928,"about_ca_topic_score_gemma":0.0006207243,"teacher_disagreement_score":0.5075195,"about_ca_system_score_codex":0.00017584595,"about_ca_system_score_gemma":0.00014933645,"threshold_uncertainty_score":0.99996495},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027997335,0.00012072396,0.96998185,0.00032347225,0.00036241522,0.0003221137,0.00008838413,0.00013867229,0.00066501444],"genre_scores_gemma":[0.64249927,0.0000013020464,0.35674042,0.000397671,0.00013427707,0.00005265754,0.00014160003,0.000010354113,0.000022452447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867976,0.000056971807,0.0002902365,0.00041576708,0.00028584315,0.00027141906],"domain_scores_gemma":[0.99864006,0.00061318773,0.00013643129,0.0003843599,0.00016441337,0.00006153269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029081668,0.00017504838,0.00017224088,0.00010981065,0.00044535284,0.00024025283,0.0008741896,0.000051762152,0.00007508951],"category_scores_gemma":[0.000092347684,0.00013498336,0.00018340627,0.00046820607,0.00011356669,0.00054135773,0.0002867473,0.00012226151,0.000014191681],"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.00014428532,0.00025137677,0.0056499955,0.00006248725,0.00048168775,0.000005147175,0.012808387,0.0040229107,0.00063213333,0.8047321,0.0034052853,0.16780424],"study_design_scores_gemma":[0.00038504196,0.000084527346,0.029959748,0.000009253992,0.000013260101,0.0000035135777,0.00024360431,0.6569326,0.0004379577,0.3098722,0.0018240354,0.00023426919],"about_ca_topic_score_codex":0.00012207143,"about_ca_topic_score_gemma":0.0000063747234,"teacher_disagreement_score":0.65290964,"about_ca_system_score_codex":0.000023946335,"about_ca_system_score_gemma":0.000050067618,"threshold_uncertainty_score":0.55044615},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66322094,0.00027526807,0.31741408,0.00093893474,0.00043051213,0.0006170615,0.00007392088,0.0005800596,0.016449234],"genre_scores_gemma":[0.8820876,0.0000020298378,0.11618952,0.00011445634,0.00016573074,0.00002689201,0.000029058361,0.00006487882,0.0013198539],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980185,0.00006291825,0.00042778047,0.00037018053,0.0007465029,0.00037408975],"domain_scores_gemma":[0.99712,0.0019052927,0.00025059815,0.00037637842,0.00019591137,0.00015178316],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018935151,0.00030018692,0.00037167902,0.00016195238,0.0001998664,0.00007954844,0.00030010645,0.000079288875,0.0005346944],"category_scores_gemma":[0.0006753478,0.0002454387,0.000099163415,0.0006840931,0.00013207896,0.00025112834,0.00010594469,0.00023764197,0.00022940348],"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.00006782094,0.0006959377,0.00808178,0.0003836698,0.0002845088,0.00008645965,0.0010801272,0.0030231993,0.00002007204,0.97686577,0.0054794597,0.003931173],"study_design_scores_gemma":[0.0013860192,0.00025244366,0.004643625,0.00015642322,0.00011295406,0.0000870922,0.00025239895,0.019895617,0.000092412585,0.9700478,0.002408919,0.0006643172],"about_ca_topic_score_codex":0.000004104633,"about_ca_topic_score_gemma":0.0000023969696,"teacher_disagreement_score":0.21886666,"about_ca_system_score_codex":0.0000767028,"about_ca_system_score_gemma":0.000022321246,"threshold_uncertainty_score":0.99999976},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41037077,0.00046361896,0.5856595,0.0006138544,0.0008714023,0.00016857024,0.000008556426,0.0001526596,0.0016910828],"genre_scores_gemma":[0.92726445,0.000005319422,0.07120722,0.0009290761,0.00029568528,0.000022742177,0.00012573239,0.000013712332,0.0001360912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9978286,0.00019228586,0.00039843738,0.00044870132,0.00064699556,0.00048499127],"domain_scores_gemma":[0.9986809,0.0003714593,0.00011925886,0.0003944326,0.0001582522,0.00027568053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007189911,0.00021549348,0.00020019722,0.0006131857,0.00019311582,0.00015616223,0.0006226037,0.00008623544,0.00016891812],"category_scores_gemma":[0.000062833664,0.00021014822,0.00007746338,0.0019186224,0.00005969597,0.002136133,0.0002031376,0.00020821806,0.00018023852],"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.00001269551,0.0003006261,0.022696093,0.000009287957,0.000017556371,0.000009015037,0.00063441996,0.25086927,0.0004092331,0.7108425,0.00029800946,0.0139012765],"study_design_scores_gemma":[0.00048557227,0.00009400368,0.6631436,0.000024606106,0.0000072586777,0.000035711044,0.00005292406,0.27298772,0.0002357686,0.060620584,0.00186059,0.00045169215],"about_ca_topic_score_codex":0.000018763301,"about_ca_topic_score_gemma":0.0000036837441,"teacher_disagreement_score":0.65022194,"about_ca_system_score_codex":0.00009368606,"about_ca_system_score_gemma":0.00010178977,"threshold_uncertainty_score":0.8569596},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10584158,0.0004957007,0.8875955,0.00039414887,0.0006874995,0.00014427905,0.000009256581,0.00021887165,0.0046132025],"genre_scores_gemma":[0.81738657,0.0000032653618,0.18135326,0.00066560815,0.00011436345,0.0000133108515,0.00006470708,0.000017132927,0.0003818076],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99747676,0.0001742811,0.00045767397,0.00066563865,0.0007654236,0.0004602002],"domain_scores_gemma":[0.99852145,0.00037006862,0.00017903627,0.0003463884,0.00026936294,0.0003136832],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059756666,0.00027877616,0.00024922428,0.00055193936,0.00091395935,0.00093900715,0.0005358349,0.00009091325,0.0001684773],"category_scores_gemma":[0.0003833211,0.00028992706,0.00016709813,0.0019545385,0.00012764505,0.0009998037,0.00013221512,0.00021540647,0.00012442927],"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.000007909456,0.000040487987,0.0032166091,0.000015784655,0.000058249538,0.000021301008,0.00071234454,0.62355816,0.00032311186,0.3543273,0.0009140207,0.016804734],"study_design_scores_gemma":[0.0016486401,0.00018935323,0.059909098,0.00007892124,0.000032338165,0.00021845028,0.00041903587,0.7696875,0.00230455,0.12966785,0.034571543,0.0012727176],"about_ca_topic_score_codex":0.0000091842285,"about_ca_topic_score_gemma":0.000002591333,"teacher_disagreement_score":0.711545,"about_ca_system_score_codex":0.00009336784,"about_ca_system_score_gemma":0.0004773674,"threshold_uncertainty_score":0.9999553},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48888987,0.00010053484,0.51019305,0.0000592319,0.00010964152,0.00007378273,0.00000771721,0.00009745016,0.00046869967],"genre_scores_gemma":[0.9232448,0.0000046348987,0.076134704,0.00016192503,0.00017722885,0.000007949205,0.00019352086,0.000042509568,0.000032782154],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867904,0.0000065962154,0.00032202268,0.00029174177,0.0003830083,0.00031761362],"domain_scores_gemma":[0.9994726,0.000057357807,0.00007690774,0.00015594192,0.00012638376,0.000110797075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008507462,0.0002462698,0.00027026003,0.00022577157,0.00047469008,0.00067991036,0.0001434007,0.00017168159,0.00007496171],"category_scores_gemma":[0.000018849469,0.00020554378,0.00010103613,0.001050226,0.00015713612,0.0003487266,0.000031661126,0.00037498618,0.00003424127],"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.0000113871165,0.000007494193,0.0020662851,0.00002984644,0.00007666045,0.000007267771,0.0003553632,0.9920916,0.00016972097,0.0001747644,0.00003256911,0.004977022],"study_design_scores_gemma":[0.00089606666,0.000052688996,0.10679113,0.00024603322,0.00005945901,0.00002793791,0.00015489505,0.8856857,0.0010199369,0.004426756,0.000115859046,0.0005235666],"about_ca_topic_score_codex":0.000031461328,"about_ca_topic_score_gemma":0.0000066509197,"teacher_disagreement_score":0.43435487,"about_ca_system_score_codex":0.00012898693,"about_ca_system_score_gemma":0.000073092335,"threshold_uncertainty_score":0.83818316},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32877982,0.00075591385,0.6657472,0.0018663974,0.000056252866,0.000071550494,0.000036705893,0.00008347416,0.0026026675],"genre_scores_gemma":[0.957864,0.000027599513,0.04158674,0.0004258791,0.000018939907,8.785782e-7,0.000033524288,0.0000018264261,0.000040636834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9988697,0.000028440349,0.0002522118,0.0003273124,0.00034268887,0.00017960266],"domain_scores_gemma":[0.9992727,0.0002173148,0.00011421292,0.00021985992,0.00007805046,0.00009786529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016581597,0.0001127611,0.00021221397,0.00051129976,0.00007792593,0.00007905202,0.00047008484,0.000040061834,0.000046626534],"category_scores_gemma":[0.00006409358,0.00009000402,0.000089050525,0.0022284628,0.00008115605,0.0003276854,0.00012212085,0.00007882331,0.000011389537],"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.000007211971,0.000103879676,0.0066163926,0.000009522208,0.00005789775,0.000009763208,0.00008829789,0.0042389613,0.00010553245,0.8936341,0.00034118933,0.094787285],"study_design_scores_gemma":[0.00023225955,0.0002237414,0.551255,0.0000066821012,0.000016602198,0.000014756245,0.000030099638,0.025519878,0.000107653505,0.42186332,0.0005516414,0.0001783597],"about_ca_topic_score_codex":0.000019814024,"about_ca_topic_score_gemma":7.479521e-7,"teacher_disagreement_score":0.62908417,"about_ca_system_score_codex":0.000006763063,"about_ca_system_score_gemma":0.00001593758,"threshold_uncertainty_score":0.36702573},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9425104,0.00093847344,0.04949173,0.000109577064,0.00008826299,0.00018534694,0.00010889744,0.000027612123,0.0065396694],"genre_scores_gemma":[0.9411924,0.000015908794,0.05855499,0.000048929465,0.000020410223,0.0000054053235,0.000011149658,0.000013176338,0.00013764387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860847,0.000058305657,0.00057532324,0.00017548303,0.00038720094,0.00019520623],"domain_scores_gemma":[0.9979755,0.001106701,0.00042616538,0.00013886881,0.00030530835,0.000047406218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050846854,0.00014659458,0.00037025707,0.00015614163,0.00009954673,0.000016544778,0.00016336214,0.000054112013,0.00018377615],"category_scores_gemma":[0.0008376554,0.00010658093,0.00008438177,0.0003557342,0.0004662195,0.00011657025,0.0001363605,0.00011101066,0.0000023763535],"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.0002776293,0.00075451186,0.09069687,0.0050534406,0.0010763044,0.000028964463,0.06272733,0.00064303115,0.00041147828,0.8048427,0.0013918192,0.03209593],"study_design_scores_gemma":[0.0015238632,0.00069317204,0.076111645,0.0005890376,0.00023925914,0.0000795382,0.03314537,0.026408348,0.0034733047,0.8567137,0.00032116935,0.00070159015],"about_ca_topic_score_codex":0.00006532772,"about_ca_topic_score_gemma":0.00000294244,"teacher_disagreement_score":0.051871017,"about_ca_system_score_codex":0.0000121090825,"about_ca_system_score_gemma":0.000061120205,"threshold_uncertainty_score":0.4346244},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8757217,0.00065671187,0.11410732,0.0006333196,0.0005059864,0.00062005274,0.00019405456,0.00010913213,0.007451761],"genre_scores_gemma":[0.97780013,0.000007540202,0.020494206,0.00031023115,0.00023852254,0.000056198845,0.00014589906,0.000040091745,0.0009071902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99813676,0.000051436185,0.00051773054,0.00025644447,0.00043738194,0.00060022756],"domain_scores_gemma":[0.9971628,0.0020719469,0.00023464758,0.00016307249,0.0002092526,0.0001582337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008174707,0.00023884408,0.00038614403,0.00033500258,0.00010787746,0.00007431544,0.00018629062,0.00010258641,0.00031568753],"category_scores_gemma":[0.0011102192,0.00022418851,0.00016069024,0.00083925825,0.00004464478,0.00041454192,0.000070289214,0.00016850981,0.000043390064],"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.00011243437,0.00028293117,0.055965472,0.00068001344,0.00013683141,0.0000046686228,0.0025166823,0.0009932775,0.000018319317,0.9302549,0.0071874685,0.0018470518],"study_design_scores_gemma":[0.0051349974,0.0003545828,0.08541295,0.00042336018,0.0001421125,0.00005582179,0.010998979,0.0070074103,0.0004240639,0.8509461,0.037504293,0.0015952936],"about_ca_topic_score_codex":0.00012742904,"about_ca_topic_score_gemma":0.000031864227,"teacher_disagreement_score":0.10207845,"about_ca_system_score_codex":0.00012994187,"about_ca_system_score_gemma":0.00007947131,"threshold_uncertainty_score":0.9142142},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5010795,0.00011483291,0.4934493,0.000120497956,0.0000587857,0.0001581242,0.00003458656,0.00005839359,0.0049259807],"genre_scores_gemma":[0.96576524,0.000016814838,0.033508223,0.000074571544,0.000040574454,0.000013479232,0.000061929706,0.00001870135,0.000500473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998858,0.00003110314,0.00032452133,0.00022588663,0.000359865,0.00020062563],"domain_scores_gemma":[0.9989828,0.00053134473,0.00011314824,0.00014793899,0.0001110287,0.00011377386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030613397,0.0001483431,0.00022801265,0.00012729772,0.00012400835,0.000098377495,0.00009593059,0.00007798043,0.000041658295],"category_scores_gemma":[0.00021284794,0.00013064242,0.00005294172,0.00023988793,0.00006824867,0.00016136705,0.000056915604,0.000114559196,0.00003325266],"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.000010432357,0.000059934577,0.00056198874,0.00014899996,0.000034197783,0.000009094044,0.00008917952,0.043738216,0.000011215394,0.9548236,0.00016546602,0.00034763734],"study_design_scores_gemma":[0.00015461574,0.0000104480905,0.0008688632,0.000033929326,0.000019659341,0.000039533494,0.00003245859,0.6048188,5.2662114e-7,0.393827,0.000090029615,0.00010409532],"about_ca_topic_score_codex":0.0000074554046,"about_ca_topic_score_gemma":0.0000011767562,"teacher_disagreement_score":0.56108063,"about_ca_system_score_codex":0.00003200274,"about_ca_system_score_gemma":0.000026719104,"threshold_uncertainty_score":0.53274435},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35293734,0.000092312875,0.64093894,0.002239411,0.0010188518,0.0001761014,0.000020141373,0.00025844734,0.002318465],"genre_scores_gemma":[0.88981,0.0000023034454,0.108120084,0.0012469686,0.0002479839,0.000022984386,0.00017686652,0.00001480205,0.00035798785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785215,0.000048684647,0.0003852239,0.0006069022,0.00074217835,0.0003648404],"domain_scores_gemma":[0.9984568,0.0004136926,0.00016711526,0.0004298585,0.0003568833,0.00017567295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036426552,0.00024232274,0.00021066234,0.0004678267,0.0003461952,0.00036617732,0.00089391216,0.00011778781,0.00018444548],"category_scores_gemma":[0.00013831657,0.0002395066,0.00013773017,0.001523493,0.00010106439,0.0008177184,0.00029138773,0.00037142652,0.0002557851],"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.000023465736,0.00023494945,0.0037218786,0.00003547601,0.00010198884,0.000034395413,0.0006315884,0.244075,0.0045089293,0.6556902,0.004526167,0.08641595],"study_design_scores_gemma":[0.0008364228,0.00012788127,0.14436854,0.000013102364,0.000017374616,0.00015262417,0.000070114664,0.72936404,0.0011612069,0.07878255,0.04437576,0.00073037244],"about_ca_topic_score_codex":0.000013825259,"about_ca_topic_score_gemma":0.000006160856,"teacher_disagreement_score":0.5769077,"about_ca_system_score_codex":0.000028383034,"about_ca_system_score_gemma":0.0001889969,"threshold_uncertainty_score":0.97667956},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96472216,0.00017504564,0.026122672,0.00044607118,0.0002684276,0.00024420983,0.000029238909,0.00008644337,0.007905712],"genre_scores_gemma":[0.9782875,0.000007141694,0.02064312,0.0004447299,0.00014462265,0.000022584465,0.000036253463,0.000021345893,0.00039266504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988785,0.000060359685,0.00025537753,0.00024816598,0.00034918365,0.00020843318],"domain_scores_gemma":[0.99844736,0.0010399658,0.00010865969,0.0001453431,0.00014621436,0.00011247412],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00020468749,0.00016179815,0.00018627285,0.00016963942,0.00031331397,0.000080579084,0.0001356641,0.00008728163,0.0013152234],"category_scores_gemma":[0.0002148199,0.00013291709,0.00007617542,0.00022242594,0.00019901658,0.00021573387,0.00012305305,0.00018623869,0.00005750025],"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.000013422825,0.000029795214,0.004995676,0.000028696963,0.00007502792,0.000002246574,0.00024714088,0.00040998406,0.000022464588,0.9880013,0.0032111183,0.0029631634],"study_design_scores_gemma":[0.00028114233,0.000034323595,0.07190086,0.00001174383,0.000015832442,0.000026170503,0.00016327621,0.0046909223,0.000014939775,0.9216112,0.0010795172,0.00017009335],"about_ca_topic_score_codex":0.0000133381645,"about_ca_topic_score_gemma":6.5047004e-7,"teacher_disagreement_score":0.06690518,"about_ca_system_score_codex":0.000021152648,"about_ca_system_score_gemma":0.000021939313,"threshold_uncertainty_score":0.9995977},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34011385,0.0009623902,0.6423859,0.0031153024,0.0004110377,0.00025844248,0.0004422089,0.00031883622,0.011992053],"genre_scores_gemma":[0.9906332,0.000032774315,0.005446308,0.00039967426,0.00013292152,0.000016063246,0.00006284914,0.000032321153,0.0032438973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99822235,0.00004971085,0.0004348582,0.00031920333,0.0005870374,0.00038685452],"domain_scores_gemma":[0.9973123,0.0019639097,0.00020060274,0.00018229402,0.00023319351,0.00010770651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039379997,0.0002205009,0.00030560658,0.00033016608,0.00016681045,0.00007453467,0.00022078342,0.00008760567,0.00058903417],"category_scores_gemma":[0.0009790496,0.0001519152,0.00012474814,0.00044924204,0.0001389292,0.00029863053,0.00009653072,0.000102022495,0.00012761456],"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.00012678833,0.00029566218,0.013990616,0.00070387,0.0006292353,0.000026027832,0.0019172755,0.00030368578,0.00048403267,0.8408842,0.102214605,0.03842401],"study_design_scores_gemma":[0.0012911853,0.00011506787,0.002517588,0.00018194885,0.000046029563,0.000020053038,0.0010850935,0.00070890423,0.00080516154,0.9799309,0.012691225,0.0006068638],"about_ca_topic_score_codex":0.000013710536,"about_ca_topic_score_gemma":0.0000019169186,"teacher_disagreement_score":0.6505194,"about_ca_system_score_codex":0.00006437879,"about_ca_system_score_gemma":0.000061978375,"threshold_uncertainty_score":0.6449511},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9742911,0.0006299246,0.01952156,0.0017882589,0.00012124045,0.0002049158,0.000042311105,0.000082359795,0.0033183154],"genre_scores_gemma":[0.992266,0.000057199115,0.006406727,0.00051307393,0.00007099539,0.00001660913,0.000019940151,0.000026465475,0.00062299776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984277,0.00012972849,0.00039589015,0.00035404548,0.00038476393,0.00030788188],"domain_scores_gemma":[0.9976129,0.0018660255,0.00012498652,0.00020381117,0.00008011625,0.00011215446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007429884,0.00020190536,0.00029460015,0.0003352792,0.00007598098,0.000025366637,0.00017840732,0.00006534565,0.0005359254],"category_scores_gemma":[0.0007512642,0.00014678316,0.000061487524,0.00060639466,0.00014092584,0.0002526454,0.00013912034,0.00012921171,0.00012826263],"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.0001344992,0.00031744043,0.09438157,0.0006375933,0.00016912748,0.00006519556,0.0006999653,0.00008651679,0.00026736155,0.8824807,0.004642626,0.016117401],"study_design_scores_gemma":[0.0013082814,0.000044276552,0.07366225,0.0004654731,0.00002070756,0.00004880131,0.00012913703,0.00020557991,0.00014381963,0.9234533,0.0002236348,0.00029479223],"about_ca_topic_score_codex":0.0000069152625,"about_ca_topic_score_gemma":0.000004156317,"teacher_disagreement_score":0.040972546,"about_ca_system_score_codex":0.00004327364,"about_ca_system_score_gemma":0.000037657872,"threshold_uncertainty_score":0.5985644},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9212407,0.00030341954,0.06994024,0.0015462018,0.00041791733,0.0009198689,0.0009410585,0.00022858566,0.0044620307],"genre_scores_gemma":[0.97208554,0.00001941219,0.026766788,0.000085924374,0.00018735793,0.00006751053,0.00047241227,0.000049600494,0.00026543395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979057,0.0001288804,0.00044084777,0.00075000565,0.0004588192,0.00031578704],"domain_scores_gemma":[0.9970676,0.0011820577,0.00049854716,0.0008130881,0.0002467953,0.00019193756],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050512515,0.00040452112,0.00056704675,0.00024447648,0.0006172174,0.0002841275,0.0006858275,0.00053162395,0.0001879539],"category_scores_gemma":[0.00040336954,0.00042642636,0.00023478799,0.00017097805,0.0005728087,0.00012617666,0.0011859774,0.0013391307,0.00003938539],"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.000034463887,0.00011695957,0.0030054883,0.0003408853,0.00019812219,0.000005515651,0.0003228942,0.0031236052,0.000009481022,0.9916811,0.00058055494,0.0005809287],"study_design_scores_gemma":[0.0003002856,0.000029017097,0.045704603,0.00017566721,0.00013232317,0.000011264957,0.00015342607,0.0060103107,0.000009469296,0.94584626,0.001199274,0.0004280881],"about_ca_topic_score_codex":0.0000485319,"about_ca_topic_score_gemma":0.000009017452,"teacher_disagreement_score":0.050844885,"about_ca_system_score_codex":0.00008492056,"about_ca_system_score_gemma":0.00015111128,"threshold_uncertainty_score":0.99981874},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15787703,0.00012624936,0.8269309,0.010963944,0.0003532167,0.0004291834,0.000015678854,0.00009026466,0.003213576],"genre_scores_gemma":[0.922446,0.0000014893179,0.07319704,0.0029205873,0.00029392182,0.00004110675,0.00012857678,0.00001470643,0.0009565489],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99731076,0.00017049623,0.0002861445,0.00057942193,0.0012565702,0.00039659935],"domain_scores_gemma":[0.99842614,0.00026478554,0.00011275949,0.0004138558,0.00055111625,0.00023135371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075748813,0.00025564615,0.00021604473,0.0005881884,0.00015015803,0.0007464509,0.0010249102,0.000059202695,0.00001078181],"category_scores_gemma":[0.00018902628,0.00018450274,0.00006963851,0.0028468112,0.000052615473,0.0008436751,0.00021490778,0.00023411632,0.00025888978],"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.00006913486,0.00020282622,0.0053023724,0.000021799024,0.00004503163,0.00008630164,0.0026024512,0.84764296,0.000045668156,0.12550667,0.008215184,0.010259622],"study_design_scores_gemma":[0.0033038799,0.0013533623,0.18809815,0.0000877506,0.000029908748,0.00035044763,0.001832453,0.6833524,0.00009861667,0.055006605,0.06514193,0.0013444975],"about_ca_topic_score_codex":0.00003850321,"about_ca_topic_score_gemma":0.000022187136,"teacher_disagreement_score":0.764569,"about_ca_system_score_codex":0.00013289759,"about_ca_system_score_gemma":0.00029422797,"threshold_uncertainty_score":0.7523804},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6866041,0.00039945712,0.26803282,0.0010349071,0.00684826,0.0012335253,0.00010321983,0.0010550906,0.034688633],"genre_scores_gemma":[0.93024516,0.0000015804632,0.06832068,0.00019749968,0.000487037,0.00003250769,0.00006774166,0.000080762904,0.0005670233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971279,0.00012831725,0.0006875163,0.00043213557,0.0011669865,0.0004571324],"domain_scores_gemma":[0.99653786,0.0016583148,0.00035415593,0.0004657104,0.00061340386,0.00037057538],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00067924213,0.00035963583,0.0005687322,0.00026127163,0.00014370971,0.000115374016,0.0004973822,0.00012399816,0.00013745637],"category_scores_gemma":[0.002317364,0.00034938843,0.00015510347,0.0007321406,0.00014862145,0.00033894167,0.00025144138,0.0003067443,0.00030391154],"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.00005058347,0.00020695226,0.0007302844,0.00006616853,0.000088456225,0.000023050263,0.00044639656,0.0021580036,0.000026184545,0.9904087,0.0055266907,0.00026849593],"study_design_scores_gemma":[0.0025071255,0.00015062866,0.00026463118,0.00005519381,0.00004993904,0.000033464297,0.00039423857,0.0038665566,0.00019091963,0.99023116,0.001822602,0.00043355397],"about_ca_topic_score_codex":0.000013374802,"about_ca_topic_score_gemma":0.0000016537866,"teacher_disagreement_score":0.2436411,"about_ca_system_score_codex":0.00019565331,"about_ca_system_score_gemma":0.00026231425,"threshold_uncertainty_score":0.9998958},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32125574,0.00013841166,0.6723431,0.00083265064,0.00054077053,0.00023052725,0.00005124495,0.000104125495,0.0045034634],"genre_scores_gemma":[0.8963027,0.000008303245,0.103080295,0.00011360383,0.00009645659,0.00001765607,0.00013620651,0.000012428409,0.00023237272],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974719,0.00012278817,0.00059624115,0.00068387564,0.0008184013,0.00030675475],"domain_scores_gemma":[0.9969298,0.0005145102,0.00058293913,0.0012582991,0.0005586834,0.0001557443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006775901,0.00021939144,0.00030595207,0.00049063907,0.0008839577,0.00043952337,0.0016561114,0.00008701275,0.00009516683],"category_scores_gemma":[0.0007125351,0.00022902465,0.00021533624,0.0007221454,0.00016491843,0.0014702723,0.00067559135,0.00018081481,0.000034212822],"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.000060101564,0.00033836107,0.042491615,0.0001274929,0.00022580379,0.00002747014,0.00083731493,0.6772526,0.001719281,0.25138813,0.0033763673,0.022155443],"study_design_scores_gemma":[0.00059756497,0.00009804219,0.33746457,0.000048506517,0.000019182404,0.000021143696,0.000056429486,0.50922495,0.0013320332,0.15039515,0.0004164259,0.000326003],"about_ca_topic_score_codex":0.00013343949,"about_ca_topic_score_gemma":0.000015745038,"teacher_disagreement_score":0.57504696,"about_ca_system_score_codex":0.000048475547,"about_ca_system_score_gemma":0.00016224913,"threshold_uncertainty_score":0.9339354},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8440622,0.00019565148,0.1358698,0.0004761888,0.00017149361,0.00024464406,0.00043471734,0.000068483,0.018476833],"genre_scores_gemma":[0.99339414,0.00003493251,0.0038912217,0.00016081221,0.00005160505,0.000016878457,0.000027308013,0.000025129631,0.0023979996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837464,0.000046485104,0.00047355512,0.00027063064,0.0005474785,0.00028720184],"domain_scores_gemma":[0.99612105,0.0030115824,0.00025419428,0.00020313574,0.00034269836,0.000067311514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030649736,0.00021234852,0.0004178836,0.0005875625,0.00010311369,0.000026782205,0.0001999815,0.000072069175,0.0002976696],"category_scores_gemma":[0.0007494697,0.0001428773,0.00015199724,0.00050063565,0.00020162872,0.00017043062,0.00007425259,0.00008234142,0.000094914736],"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.00021899538,0.00033222773,0.0018602022,0.00056995923,0.00032837508,0.000011562814,0.0017934459,0.0010550766,0.00030308444,0.9834182,0.0043615745,0.0057472745],"study_design_scores_gemma":[0.0011506124,0.0004667098,0.008351512,0.00050036254,0.00004941206,0.00001100926,0.0008104137,0.0007009061,0.004058727,0.9832157,0.00030949406,0.000375133],"about_ca_topic_score_codex":0.000024243116,"about_ca_topic_score_gemma":0.0000018190834,"teacher_disagreement_score":0.14933191,"about_ca_system_score_codex":0.000045912475,"about_ca_system_score_gemma":0.00006900564,"threshold_uncertainty_score":0.5826367},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0866626,0.00015349833,0.9102457,0.0020789944,0.00028549143,0.0002599715,0.00004544394,0.00012929273,0.00013902425],"genre_scores_gemma":[0.62965757,0.000007797455,0.36914843,0.00045657236,0.00019762282,0.000049675873,0.000049881186,0.000013833104,0.00041862426],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982092,0.000043996177,0.00036186812,0.0006313466,0.00041134167,0.00034226556],"domain_scores_gemma":[0.9981745,0.0010097935,0.0001449963,0.00021370975,0.00028048945,0.00017649676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036396136,0.00021843449,0.00021077119,0.00033180052,0.0002807915,0.0002171218,0.00039936553,0.00007289747,0.000023655872],"category_scores_gemma":[0.00020109235,0.00017259452,0.00010547595,0.00048826454,0.00009077775,0.0006231417,0.00019517225,0.00006367979,0.000032939624],"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.00007740068,0.0001453351,0.0018650816,0.000095525385,0.00014513955,0.000022075019,0.00044548282,0.04548059,0.0015861745,0.33505142,0.0019578303,0.61312795],"study_design_scores_gemma":[0.0019355477,0.0004129836,0.03056624,0.00007160665,0.000026350493,0.00012676271,0.000021765947,0.879228,0.0004770694,0.07636782,0.010142404,0.000623431],"about_ca_topic_score_codex":0.000002379436,"about_ca_topic_score_gemma":7.166186e-7,"teacher_disagreement_score":0.83374745,"about_ca_system_score_codex":0.000047093392,"about_ca_system_score_gemma":0.000114299335,"threshold_uncertainty_score":0.70382005},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030255845,0.00030759483,0.96494365,0.0018240304,0.0005883162,0.00035770517,0.00006447717,0.00006724293,0.0015911666],"genre_scores_gemma":[0.8562914,0.0000069163584,0.1432153,0.00014940929,0.00009913668,0.0000354721,0.000032287553,0.000011794565,0.00015829915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842244,0.000030508938,0.00037576366,0.00037768882,0.0004736849,0.00031991294],"domain_scores_gemma":[0.9975914,0.0007883277,0.00037395975,0.00088490057,0.00028011634,0.00008131225],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0004123578,0.00018358993,0.00022926916,0.00025614403,0.0016652661,0.00046002638,0.0018472375,0.000058309357,0.00002091781],"category_scores_gemma":[0.00018800565,0.00014611645,0.00030104356,0.00038192834,0.00030525035,0.0006192514,0.00045926502,0.00014587933,0.000006463353],"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.000019652713,0.00006367518,0.0019863374,0.000022319644,0.00013297056,0.0000021352541,0.0003273284,0.00840327,0.000024223758,0.8901002,0.00029693815,0.098620966],"study_design_scores_gemma":[0.00050018996,0.00007008274,0.2773323,0.000022837516,0.00001997932,0.000008786614,0.00004059671,0.37783018,0.000060023314,0.34233406,0.001609244,0.00017170994],"about_ca_topic_score_codex":0.000069903814,"about_ca_topic_score_gemma":0.000027160286,"teacher_disagreement_score":0.82603556,"about_ca_system_score_codex":0.00002043229,"about_ca_system_score_gemma":0.00009915623,"threshold_uncertainty_score":0.99963444},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018520547,0.00004750422,0.9764231,0.0008079363,0.00007865069,0.00010115845,0.000019200306,0.00027713407,0.0037248041],"genre_scores_gemma":[0.66708195,0.0000023344194,0.3325861,0.00015857173,0.000010475866,0.0000074312356,0.000008474804,0.000008195471,0.00013646914],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987136,0.000048571357,0.00031164123,0.00031626807,0.00042458044,0.00018534447],"domain_scores_gemma":[0.99862456,0.00042309222,0.00020893017,0.00028490947,0.00038764812,0.000070872295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026307916,0.00013348757,0.00016745257,0.00030251188,0.000050071543,0.00011471802,0.0006689629,0.000056165685,0.000017372844],"category_scores_gemma":[0.00020374959,0.00010259656,0.0000644434,0.0006053008,0.00013230223,0.001396686,0.00026269213,0.00005705594,0.000034804085],"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.000014596909,0.00012731133,0.002923741,0.00010224808,0.000027658594,0.000020321837,0.00023574122,0.00008044389,0.0030585418,0.25685462,0.0005838288,0.735971],"study_design_scores_gemma":[0.0007628301,0.0002550647,0.029471248,0.0003763962,0.000015268419,0.00007175834,0.000016346034,0.10682425,0.043180145,0.8171672,0.0012450616,0.0006143888],"about_ca_topic_score_codex":0.000003904643,"about_ca_topic_score_gemma":3.5821796e-7,"teacher_disagreement_score":0.73535657,"about_ca_system_score_codex":0.00004408387,"about_ca_system_score_gemma":0.00010014149,"threshold_uncertainty_score":0.41837662},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35228318,0.00007398011,0.6429672,0.00055340416,0.0006232118,0.00019185306,0.00005260311,0.00016065917,0.0030938806],"genre_scores_gemma":[0.9504847,0.0000027524434,0.047937285,0.00094191695,0.00020234231,0.0000103777975,0.00025813,0.000017101387,0.00014542793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974353,0.00010686596,0.0005466191,0.0006339664,0.0009235764,0.00035368413],"domain_scores_gemma":[0.99793124,0.0006565021,0.00028777224,0.0004152754,0.0005436895,0.0001655372],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037396248,0.00027350476,0.00030817193,0.0009973727,0.00030073014,0.00011913014,0.0007655464,0.00010454372,0.00011524708],"category_scores_gemma":[0.00017598062,0.00026912594,0.00016134341,0.0023170037,0.00018729553,0.0004646705,0.000095255644,0.000178404,0.00018804119],"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.00009829587,0.00018210166,0.001008771,0.00003256095,0.00012790888,0.000014837902,0.00056021183,0.02921388,0.0010638705,0.9531603,0.0049803024,0.0095569845],"study_design_scores_gemma":[0.0018889381,0.0016484229,0.11115588,0.00013033536,0.000035617206,0.00007657907,0.00007313177,0.30324826,0.0042844643,0.5739875,0.0025810215,0.00088984787],"about_ca_topic_score_codex":0.00003047026,"about_ca_topic_score_gemma":0.000006065543,"teacher_disagreement_score":0.5982015,"about_ca_system_score_codex":0.00004745646,"about_ca_system_score_gemma":0.00015383323,"threshold_uncertainty_score":0.9999761},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35700157,0.00009866878,0.6401569,0.00016103697,0.0004274159,0.00011317969,0.00003063901,0.00004617797,0.001964377],"genre_scores_gemma":[0.9711017,0.0000031540767,0.028515503,0.00010793598,0.000058895177,0.0000090084595,0.0001002571,0.000008882723,0.0000946604],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825084,0.000076302305,0.00048462325,0.00031173776,0.0007091901,0.00016727974],"domain_scores_gemma":[0.9982876,0.0004246419,0.00025932363,0.00029182778,0.0006173119,0.000119266195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037310194,0.00015461125,0.00025412752,0.0008236253,0.00007850297,0.000039810428,0.0004793279,0.000058633144,0.000023186869],"category_scores_gemma":[0.00024307735,0.0001548839,0.00012888975,0.0017766173,0.00010541731,0.00034964434,0.0001608553,0.00011811734,0.000026915404],"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.000055951783,0.00019689946,0.0024562443,0.00003283681,0.00008147076,0.0000022566926,0.00058447424,0.6493493,0.00022184139,0.32962668,0.00091702206,0.016475031],"study_design_scores_gemma":[0.0018739313,0.001017807,0.1104713,0.00010003084,0.000030090861,0.000025660062,0.0005027228,0.56586766,0.0028449195,0.3159436,0.00088529626,0.000436993],"about_ca_topic_score_codex":0.000057166,"about_ca_topic_score_gemma":0.000017483897,"teacher_disagreement_score":0.6141001,"about_ca_system_score_codex":0.000038777198,"about_ca_system_score_gemma":0.00022801444,"threshold_uncertainty_score":0.6315983},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10211681,0.00018280388,0.8876466,0.0030765182,0.00015771766,0.0002629431,0.000014325415,0.00035459787,0.0061876737],"genre_scores_gemma":[0.9322574,0.0000032469654,0.06603819,0.00066678814,0.000074043724,0.000059913687,0.0001302772,0.000012364925,0.00075776613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861056,0.00002995015,0.0002681653,0.0004109444,0.00039407448,0.00028629726],"domain_scores_gemma":[0.9990021,0.00012826425,0.00009349605,0.00048272943,0.00012265038,0.00017077755],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000109451124,0.00015188019,0.00014587582,0.0002347391,0.00020693899,0.0002951823,0.00077982305,0.000050525756,0.00040880666],"category_scores_gemma":[0.000021151005,0.00014619117,0.0001038133,0.0010053238,0.00006456744,0.0006012747,0.00022916721,0.00013157076,0.0025473703],"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.0000020711138,0.00017911704,0.0033780395,0.000026998478,0.0000798085,0.000017287355,0.00037592486,0.012783063,0.0014415232,0.8954113,0.026117243,0.06018764],"study_design_scores_gemma":[0.0004723998,0.000050823048,0.22301403,0.00001945524,0.00001206346,0.00007597573,0.00005947142,0.62927,0.00038027836,0.13064356,0.0154586695,0.0005432827],"about_ca_topic_score_codex":0.00007020719,"about_ca_topic_score_gemma":7.049422e-7,"teacher_disagreement_score":0.8301406,"about_ca_system_score_codex":0.00003404972,"about_ca_system_score_gemma":0.00007600182,"threshold_uncertainty_score":0.99822927},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1622979,0.00008980699,0.83285314,0.0035227984,0.00046714477,0.0002656532,0.000115707866,0.00011158266,0.00027628816],"genre_scores_gemma":[0.8720882,0.0000057345596,0.12584263,0.00086367124,0.00031510484,0.000031175827,0.00017947968,0.000016490798,0.0006575024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823296,0.000059785893,0.0003901982,0.00057741895,0.000432922,0.0003067408],"domain_scores_gemma":[0.9978354,0.0013318165,0.0001486787,0.00024772968,0.00029025078,0.00014615027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035796146,0.00021191397,0.0001993469,0.00043802173,0.00036603358,0.00019901793,0.00029796653,0.00007880088,0.00003601408],"category_scores_gemma":[0.00031321685,0.0001631226,0.00013052912,0.0006678053,0.000063860345,0.0005552877,0.00017454437,0.00008095875,0.000029743507],"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.000101841026,0.0002304553,0.0012531445,0.000018977344,0.00009556877,0.0000044371814,0.00016012604,0.052292477,0.0006856018,0.6353212,0.0015142213,0.30832195],"study_design_scores_gemma":[0.0038946602,0.00072344247,0.111138746,0.0001421385,0.000037018748,0.000046339195,0.00003271929,0.65927535,0.00041375385,0.20622002,0.017246654,0.0008291687],"about_ca_topic_score_codex":0.0000031055383,"about_ca_topic_score_gemma":0.0000025717613,"teacher_disagreement_score":0.7097903,"about_ca_system_score_codex":0.000071971364,"about_ca_system_score_gemma":0.00011607689,"threshold_uncertainty_score":0.6651947},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24485256,0.00012932488,0.7378635,0.0057866336,0.0006725338,0.00021252481,0.000031613312,0.00006457948,0.010386765],"genre_scores_gemma":[0.9875314,0.0000058819983,0.011232567,0.00070029474,0.00011923341,0.000014134359,0.000038811242,0.000009078002,0.0003485671],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998279,0.00008010995,0.00033587372,0.00036772928,0.0007228655,0.00021447397],"domain_scores_gemma":[0.9975136,0.0009001488,0.00039730442,0.00081452826,0.00029946794,0.00007497206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000534088,0.00017281258,0.00019402997,0.00021121722,0.00093418127,0.00048612736,0.0014972365,0.0000551359,0.000089665285],"category_scores_gemma":[0.0004515869,0.0001277358,0.00014149287,0.00033564196,0.00022438234,0.0005353264,0.0003433252,0.00015922618,0.00008888561],"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.000012558305,0.00005678705,0.0006242901,0.000009542466,0.000045063596,0.0000032049336,0.0001274518,0.06924696,0.000095563715,0.9188907,0.0019550745,0.008932791],"study_design_scores_gemma":[0.00064500456,0.00022163283,0.16997872,0.000060645576,0.00001499999,0.000018109418,0.000043489184,0.35724396,0.0014806121,0.46696734,0.0029716454,0.0003538311],"about_ca_topic_score_codex":0.000017204697,"about_ca_topic_score_gemma":0.0000027310498,"teacher_disagreement_score":0.7426789,"about_ca_system_score_codex":0.000028336643,"about_ca_system_score_gemma":0.00013768967,"threshold_uncertainty_score":0.71850616},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9740372,0.00016443407,0.017485483,0.00038833334,0.0010905236,0.00049535243,0.00011301836,0.00003786113,0.006187814],"genre_scores_gemma":[0.992592,0.0000025048396,0.006281013,0.00030459338,0.00030130238,0.00002306031,0.000010851829,0.000025188065,0.00045949113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998766,0.000063735555,0.0003256683,0.00017117195,0.00045706407,0.00021635412],"domain_scores_gemma":[0.99741864,0.0017229847,0.00019695827,0.00039496247,0.00023063867,0.0000357884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045936552,0.00015030026,0.00021172516,0.000048579514,0.0005791867,0.000038536586,0.00046854423,0.00006497873,0.00030946173],"category_scores_gemma":[0.00043469813,0.00007809893,0.00020112668,0.00036028013,0.00046424108,0.00006245101,0.00012542817,0.000114862385,0.000013239168],"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.000117029675,0.000090208945,0.0045735836,0.0002066572,0.00042273043,6.1457695e-7,0.0015603788,0.00070748036,0.0000931212,0.98235095,0.008301556,0.0015756701],"study_design_scores_gemma":[0.00046753202,0.00005898414,0.022461554,0.000057179484,0.000102554426,0.000024073546,0.00015895462,0.005910611,0.00027563068,0.966902,0.0034249476,0.0001559523],"about_ca_topic_score_codex":0.000010059529,"about_ca_topic_score_gemma":0.0000043661203,"teacher_disagreement_score":0.018554814,"about_ca_system_score_codex":0.000021383037,"about_ca_system_score_gemma":0.00005148916,"threshold_uncertainty_score":0.44546947},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74559575,0.0016603919,0.24339098,0.00082399725,0.0009594827,0.0005566534,0.00019882624,0.00027340153,0.006540486],"genre_scores_gemma":[0.90896267,0.00003191433,0.087014124,0.00035945815,0.0004364576,0.00006611674,0.0012618188,0.000103142906,0.0017643002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962146,0.00018555613,0.00074808527,0.0010818995,0.0011320563,0.00063776213],"domain_scores_gemma":[0.9967172,0.0011922088,0.0005335826,0.00070929603,0.00058812095,0.0002595977],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004461341,0.0006461601,0.0010110638,0.000780865,0.00020125334,0.00022826588,0.00065219944,0.0005280284,0.0015122241],"category_scores_gemma":[0.0005808082,0.000575586,0.00035495553,0.0012747844,0.00024390544,0.00013837856,0.0012313932,0.0011114301,0.00009020578],"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.00045230356,0.0022250602,0.024740944,0.006329451,0.0073358375,0.0022813366,0.0055524623,0.1523606,0.000080289654,0.7509119,0.027570484,0.02015936],"study_design_scores_gemma":[0.0033375248,0.0006186981,0.057762887,0.0013546498,0.00094083446,0.0005697593,0.0030030273,0.009943313,0.00021138322,0.91600686,0.0028362293,0.0034148328],"about_ca_topic_score_codex":0.00007371025,"about_ca_topic_score_gemma":0.000018989822,"teacher_disagreement_score":0.165095,"about_ca_system_score_codex":0.0001739691,"about_ca_system_score_gemma":0.00064822036,"threshold_uncertainty_score":0.99966955},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97650355,0.00040584695,0.017780952,0.00022720399,0.0017280359,0.0005973709,0.0013697026,0.00020514822,0.001182182],"genre_scores_gemma":[0.98862886,0.00005986904,0.009547832,0.00024208134,0.00012108128,0.000023032915,0.0012808638,0.00007371093,0.000022641854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996959,0.00017946359,0.00094542844,0.00074443343,0.00083345146,0.00033823945],"domain_scores_gemma":[0.9972013,0.0007580961,0.0010893801,0.00048419798,0.00028811098,0.00017891901],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034833496,0.0005375229,0.00090714847,0.0007248548,0.00016594559,0.00007324058,0.0005563216,0.0004108375,0.00015841112],"category_scores_gemma":[0.0003049341,0.00051515957,0.00057713676,0.0005230008,0.00024410301,0.00009455586,0.0009958693,0.0010448294,0.0000063318644],"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.0003858364,0.00017962635,0.021850554,0.0038481406,0.0026649374,0.00008260959,0.004071587,0.019908803,0.000074729396,0.94081604,0.0044104173,0.0017067029],"study_design_scores_gemma":[0.0004951454,0.00008322472,0.031100247,0.00046067624,0.00021765562,0.000018917173,0.00041214193,0.0040975143,0.00014539825,0.962304,0.0001515536,0.0005135456],"about_ca_topic_score_codex":0.00006312492,"about_ca_topic_score_gemma":0.000009504025,"teacher_disagreement_score":0.021487923,"about_ca_system_score_codex":0.0000660869,"about_ca_system_score_gemma":0.00007828838,"threshold_uncertainty_score":0.99973},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97572875,0.0005137524,0.018817324,0.00020200355,0.00023296931,0.00013946374,0.0003166681,0.00006011633,0.003988978],"genre_scores_gemma":[0.9859884,0.0000062024687,0.013018814,0.00014053655,0.00006192701,0.00002613022,0.00007814481,0.000022585953,0.0006572632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984593,0.00007569896,0.00039940357,0.00025754175,0.00057768513,0.00023041287],"domain_scores_gemma":[0.9986964,0.00075068866,0.0001996401,0.00014998077,0.00012811543,0.00007521716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042197542,0.0001553716,0.0002804585,0.0007212698,0.00033286164,0.000036412068,0.00017470047,0.00003404264,0.0005797763],"category_scores_gemma":[0.00024960836,0.00015741949,0.000106344625,0.0015007044,0.00009845553,0.00013943383,0.00025703968,0.00021480212,0.000003990997],"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.00015346224,0.0003711158,0.010105131,0.0005784327,0.000351034,0.000017298678,0.0022161454,0.008438122,0.00016874827,0.9722745,0.0015664197,0.003759583],"study_design_scores_gemma":[0.0025074678,0.0012206432,0.05494921,0.000061957784,0.00023390786,0.00044279816,0.014906184,0.016416876,0.00075317366,0.8952879,0.012007227,0.0012126769],"about_ca_topic_score_codex":0.00011663174,"about_ca_topic_score_gemma":0.0000014236864,"teacher_disagreement_score":0.07698663,"about_ca_system_score_codex":0.000058701986,"about_ca_system_score_gemma":0.00008988356,"threshold_uncertainty_score":0.64193803},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1362397,0.000033399556,0.85553867,0.0054501984,0.00066420884,0.00032373267,0.000014431276,0.00045301995,0.0012826591],"genre_scores_gemma":[0.99037826,0.000003463411,0.007019031,0.0012990872,0.0002931975,0.00004540925,0.00027335653,0.000016914411,0.0006712563],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978477,0.00016411569,0.000401765,0.0005134442,0.0007121691,0.00036083598],"domain_scores_gemma":[0.9977041,0.0014174541,0.00017917893,0.000385107,0.00021594195,0.000098220364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009956033,0.00021015461,0.00016429147,0.0005372908,0.0005884862,0.00033850395,0.0006414426,0.00007158295,0.00005462715],"category_scores_gemma":[0.00038093803,0.00016266767,0.00014991744,0.0034304454,0.000044367596,0.00042066994,0.00022222039,0.00020908714,0.0004741527],"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.000016477316,0.00003255612,0.00019337957,0.0000063182574,0.000042866286,0.0000060079647,0.00029740637,0.58054227,0.0004071314,0.38678142,0.0028355683,0.028838627],"study_design_scores_gemma":[0.0003608951,0.00007864828,0.029950246,0.000015143374,0.000006126,0.000007692057,0.000044940414,0.9215655,0.00034775038,0.04619119,0.0012189192,0.00021299183],"about_ca_topic_score_codex":0.0000078829335,"about_ca_topic_score_gemma":0.0000013112224,"teacher_disagreement_score":0.8541386,"about_ca_system_score_codex":0.00006850522,"about_ca_system_score_gemma":0.00011719578,"threshold_uncertainty_score":0.6633395},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16794108,0.0016523987,0.8237679,0.0017715924,0.001917938,0.00059283274,0.0003629204,0.00034391816,0.0016494166],"genre_scores_gemma":[0.8885135,0.00007646914,0.107670955,0.00080500887,0.0002932827,0.00012766654,0.0020257114,0.000033985987,0.0004534374],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959803,0.00025387196,0.00065738993,0.001363758,0.0013179709,0.00042668133],"domain_scores_gemma":[0.99781203,0.0005690924,0.00039610962,0.0006251759,0.00034090446,0.00025666424],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006470541,0.00048329253,0.0004823376,0.0008393134,0.00056562567,0.0006843341,0.0009783685,0.00020767827,0.00028066293],"category_scores_gemma":[0.00013098106,0.0005522558,0.00018886525,0.0012722634,0.000110707675,0.000415834,0.003726007,0.0009066136,0.000043322387],"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.000017779994,0.00011277988,0.0010054561,0.00014516369,0.00014464783,0.000066831766,0.00053073943,0.8814932,0.00002432176,0.0954507,0.0023165238,0.018691817],"study_design_scores_gemma":[0.00054359203,0.00013594676,0.03928462,0.000049229726,0.000036188536,0.00011204272,0.00006105143,0.81451756,0.000029091543,0.13813391,0.006256966,0.000839829],"about_ca_topic_score_codex":0.00003554746,"about_ca_topic_score_gemma":0.0000027315753,"teacher_disagreement_score":0.7205724,"about_ca_system_score_codex":0.00017245393,"about_ca_system_score_gemma":0.0006759567,"threshold_uncertainty_score":0.9996929},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26213324,0.000097932025,0.7339563,0.0015307971,0.0007468472,0.00017804009,0.000042956133,0.00061113056,0.0007027569],"genre_scores_gemma":[0.97129554,0.000009592849,0.026569346,0.00062406814,0.0002038139,0.00002999323,0.00058808085,0.000027068063,0.00065251504],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972113,0.00014597843,0.00050350337,0.00072751305,0.00088776543,0.000523937],"domain_scores_gemma":[0.9983192,0.0006990842,0.00019647382,0.00033265463,0.00024328895,0.00020930721],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007857076,0.00027832726,0.00024669644,0.00077207974,0.00044297293,0.00039848514,0.0007104193,0.00008535289,0.00006018774],"category_scores_gemma":[0.0002603401,0.00029197818,0.00016854427,0.003339913,0.000051456584,0.0009110759,0.00048809501,0.00025390496,0.00047069447],"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.000052564148,0.0002109601,0.0066020414,0.00013057831,0.00028704526,0.00013619925,0.0024238918,0.6458869,0.003544875,0.086192116,0.060930733,0.19360211],"study_design_scores_gemma":[0.00066923583,0.00010178629,0.023083203,0.00005017543,0.000011262387,0.000040442315,0.0002142997,0.94010365,0.00049063965,0.029833142,0.004878262,0.0005239047],"about_ca_topic_score_codex":0.000018674993,"about_ca_topic_score_gemma":0.0000028856487,"teacher_disagreement_score":0.7091623,"about_ca_system_score_codex":0.00010507684,"about_ca_system_score_gemma":0.00011561631,"threshold_uncertainty_score":0.9999532},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03283402,0.0008293243,0.95400715,0.0020448081,0.000655031,0.00014477545,0.000012589477,0.00033527435,0.009137014],"genre_scores_gemma":[0.8968956,0.000012694436,0.100224026,0.001164445,0.00025554813,0.000015714142,0.00008094378,0.0000149410635,0.0013360744],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788547,0.00008571915,0.00038494906,0.00055351737,0.0007105785,0.00037974227],"domain_scores_gemma":[0.99879855,0.0003147757,0.0001404483,0.000345675,0.0002071939,0.0001933324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024392587,0.00022704726,0.00019860613,0.0005554921,0.00037329717,0.0003159233,0.0006643518,0.00007599778,0.0004623538],"category_scores_gemma":[0.000105509884,0.00023301157,0.0001459813,0.0017923176,0.000053241612,0.0008400728,0.00023071653,0.00021121485,0.00072624447],"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.000006971552,0.00021013303,0.0014192952,0.000024587223,0.00010031387,0.00004004163,0.0008625202,0.5081085,0.00031998658,0.3586818,0.014418934,0.11580696],"study_design_scores_gemma":[0.00046415447,0.000078036726,0.014438068,0.00001641644,0.0000091376105,0.00008648357,0.000026124375,0.948824,0.00014519914,0.01996084,0.015560027,0.00039149754],"about_ca_topic_score_codex":0.000006370568,"about_ca_topic_score_gemma":9.562483e-7,"teacher_disagreement_score":0.8640616,"about_ca_system_score_codex":0.00006201358,"about_ca_system_score_gemma":0.000043274373,"threshold_uncertainty_score":0.9501936},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9631577,0.00031566294,0.023451567,0.0048746876,0.0007302711,0.00096845283,0.00007101668,0.0005164677,0.005914133],"genre_scores_gemma":[0.99120337,0.000028222052,0.007523058,0.0005796296,0.0001416128,0.00008526176,0.00015392259,0.000041656833,0.00024329769],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99787366,0.00014108226,0.00047122527,0.00028327593,0.0008726394,0.0003581129],"domain_scores_gemma":[0.9962045,0.0031361121,0.00015058609,0.00033920456,0.000110571855,0.000059048052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000945698,0.00019623149,0.00027388858,0.00033781683,0.00013992017,0.00005265119,0.0004950555,0.00006552864,0.00005948346],"category_scores_gemma":[0.001473864,0.00015599774,0.000118128766,0.0021418706,0.00008306039,0.00017552392,0.0001319297,0.0002971002,0.00023069858],"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.000016633845,0.00019029655,0.00483648,0.00051665603,0.0000571531,0.000078967336,0.00097349886,0.0044260984,0.000009570678,0.97194475,0.01567771,0.0012721694],"study_design_scores_gemma":[0.00037745608,0.000034823435,0.037049245,0.00021298038,0.000017311664,0.00001951021,0.0003670154,0.00431048,0.0000061994024,0.9566435,0.0007533291,0.00020812546],"about_ca_topic_score_codex":0.0000037726434,"about_ca_topic_score_gemma":0.00000668867,"teacher_disagreement_score":0.032212764,"about_ca_system_score_codex":0.000044272118,"about_ca_system_score_gemma":0.00006287924,"threshold_uncertainty_score":0.63614035},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06786209,0.0013388669,0.9289517,0.00059159653,0.00039853825,0.00025708546,0.00015097288,0.0002556067,0.0001935814],"genre_scores_gemma":[0.85715234,0.00007404239,0.14105995,0.00024112467,0.00034450684,0.000028129818,0.0010382861,0.000046638386,0.000014959819],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879485,0.000016741746,0.00035878018,0.00038575756,0.00024563502,0.00019822823],"domain_scores_gemma":[0.9992301,0.00029941395,0.000084816944,0.00012230301,0.00014237099,0.000121001474],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00007567904,0.00028156897,0.0004091182,0.00015779218,0.00009174827,0.00020098645,0.00015204297,0.0003391889,0.00005448151],"category_scores_gemma":[0.00018288908,0.00027511097,0.00018677271,0.00038940093,0.000047643545,0.00007556398,0.00020789931,0.0006004625,0.0000045601596],"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.000009378465,0.0000025433762,0.00086297316,0.00027730007,0.00020820078,0.0000014619212,0.00010658767,0.98895985,0.0000068026516,0.0016457266,0.00069104263,0.007228126],"study_design_scores_gemma":[0.00016021905,0.00001951105,0.014243829,0.00006990411,0.000095544696,0.0000019531142,0.000054433865,0.9483988,0.000025597436,0.03618208,0.00041692078,0.00033118186],"about_ca_topic_score_codex":0.00000873781,"about_ca_topic_score_gemma":0.0000012578854,"teacher_disagreement_score":0.78929025,"about_ca_system_score_codex":0.00005077664,"about_ca_system_score_gemma":0.00002036318,"threshold_uncertainty_score":0.9999701},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053865235,0.00045485457,0.9415022,0.0026063835,0.0005779368,0.00042209716,0.00021314977,0.00014824004,0.0002098872],"genre_scores_gemma":[0.90543884,0.000005528072,0.09207516,0.0009505207,0.0001452471,0.00016594342,0.00084139244,0.00001975029,0.0003576124],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997999,0.00009725368,0.00039696097,0.00059037353,0.000590998,0.00032538205],"domain_scores_gemma":[0.99884015,0.00040143018,0.00016322105,0.00024525222,0.00019569507,0.00015426747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042042544,0.0001985822,0.0001965906,0.00055959733,0.0012585032,0.00023338526,0.0004374002,0.00003415086,0.00007034618],"category_scores_gemma":[0.000101393634,0.00022756541,0.00010811368,0.0014131803,0.000050103845,0.00047017896,0.0005876101,0.0001683247,0.0000075293956],"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.00002157703,0.00015496908,0.0010800593,0.000027105469,0.000076368684,0.0000047261597,0.00050946366,0.7243386,0.0005048463,0.24923454,0.0012890028,0.022758765],"study_design_scores_gemma":[0.0009880959,0.00026058656,0.011659132,0.00000965917,0.000023377921,0.000085557826,0.00017185917,0.92972416,0.00016398921,0.05121887,0.0053003794,0.0003943207],"about_ca_topic_score_codex":0.0000119014585,"about_ca_topic_score_gemma":0.0000014843848,"teacher_disagreement_score":0.8515736,"about_ca_system_score_codex":0.00011192214,"about_ca_system_score_gemma":0.000181011,"threshold_uncertainty_score":0.96795166},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9602061,0.00018855199,0.035954636,0.00013657422,0.00035846588,0.00009685946,0.00005442824,0.0006552356,0.0023491345],"genre_scores_gemma":[0.9970134,0.000032707198,0.0018390116,0.00006357872,0.00006986407,0.000006667175,0.0007379049,0.000021465665,0.00021543932],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991642,0.000013270355,0.0001983395,0.00016346796,0.00026217604,0.00019851667],"domain_scores_gemma":[0.9996615,0.000079972095,0.000027213739,0.00009813433,0.00006254192,0.000070609916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000068888236,0.00012735033,0.00013774025,0.00034519474,0.00009289382,0.000057552672,0.00008950137,0.00004613545,0.00021806834],"category_scores_gemma":[0.000020019943,0.00011725803,0.00010579823,0.0010128765,0.00002655351,0.000115201554,0.000025990665,0.00007958773,0.00021808164],"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.0000020675068,0.0000017978235,0.004613352,0.000012184108,0.000059167873,0.000009085281,0.000061196624,0.9893694,0.000025848936,0.0017126034,0.0026374292,0.0014958599],"study_design_scores_gemma":[0.00014116707,0.000007992626,0.119325906,0.000008127657,0.000019830959,0.000005691831,0.0000604492,0.8685599,0.00006672739,0.01097948,0.00065688783,0.00016782166],"about_ca_topic_score_codex":0.000007043539,"about_ca_topic_score_gemma":0.0000037185857,"teacher_disagreement_score":0.12080949,"about_ca_system_score_codex":0.000023254817,"about_ca_system_score_gemma":0.0000070315004,"threshold_uncertainty_score":0.47816437},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94287384,0.000113894166,0.055810135,0.00018511391,0.00024453088,0.00025734765,0.000046008317,0.00019056536,0.000278543],"genre_scores_gemma":[0.99572015,0.00001372325,0.004065872,0.0000293131,0.000023600638,0.00001960756,0.000090625654,0.000010470116,0.000026656553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982944,0.00017214095,0.00028717815,0.00040051056,0.00059086975,0.0002548981],"domain_scores_gemma":[0.9987305,0.00042274842,0.00009775617,0.0002729008,0.00037822075,0.00009790098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006554015,0.00013040012,0.00018916851,0.0006013294,0.00015986148,0.000074941956,0.0003917029,0.000054597323,0.000014742092],"category_scores_gemma":[0.0002454072,0.00011956133,0.000069774374,0.002467848,0.00025339526,0.0005077616,0.0003587707,0.00015617086,0.000039231898],"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.000276288,0.0002457786,0.03434844,0.0005427263,0.00014938296,0.000026937189,0.0019439411,0.013709859,0.001713168,0.8623866,0.0001760864,0.08448083],"study_design_scores_gemma":[0.00055534777,0.00016888003,0.074169636,0.000048989114,0.000004261499,0.000005315251,0.00015971066,0.046957225,0.00075267453,0.8769742,0.000037581096,0.0001661397],"about_ca_topic_score_codex":0.0000149509115,"about_ca_topic_score_gemma":0.0000010344346,"teacher_disagreement_score":0.0843147,"about_ca_system_score_codex":0.000016169586,"about_ca_system_score_gemma":0.0000664312,"threshold_uncertainty_score":0.48755696},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20520924,0.0004157054,0.7843464,0.0022896002,0.0013421917,0.00026511672,0.000034508324,0.0003513176,0.005745904],"genre_scores_gemma":[0.96030945,0.000002785002,0.036288,0.0020816617,0.00011200621,0.00007001404,0.00033565096,0.00001876008,0.00078169856],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970816,0.00018904178,0.00040296456,0.0006670696,0.0012675456,0.00039177743],"domain_scores_gemma":[0.9988191,0.00030446835,0.00017633986,0.00035383613,0.00017166669,0.00017455286],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005619365,0.00022938746,0.00020634836,0.0008481594,0.0010789527,0.00025872202,0.0009648215,0.000038305432,0.00045843676],"category_scores_gemma":[0.0000744127,0.00026255078,0.00018962202,0.002929578,0.000052981984,0.0006387301,0.00076426053,0.0003225657,0.00015728267],"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.000012074895,0.00006702606,0.0004384508,0.0000070676797,0.000034160523,0.000027372062,0.00029456685,0.64317846,0.00009456928,0.3437337,0.0015725553,0.010539993],"study_design_scores_gemma":[0.0010199809,0.0003680086,0.017798591,0.000008615725,0.00002068729,0.00031615654,0.00037085195,0.6207913,0.00019630871,0.32736224,0.030964172,0.00078304455],"about_ca_topic_score_codex":0.000029223214,"about_ca_topic_score_gemma":8.8793854e-7,"teacher_disagreement_score":0.7551002,"about_ca_system_score_codex":0.00013984065,"about_ca_system_score_gemma":0.00027909369,"threshold_uncertainty_score":0.99998266},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9907265,0.00032178545,0.006588249,0.0005036457,0.00015549283,0.00008909116,0.00007872992,0.00003828626,0.0014982219],"genre_scores_gemma":[0.9851072,0.0000031551976,0.014084698,0.00046649657,0.000025116142,0.000013031862,0.00008513512,0.00001160698,0.00020355225],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988589,0.000061563915,0.00020781723,0.0002926073,0.00036238035,0.00021670945],"domain_scores_gemma":[0.9995594,0.000114068,0.000047600013,0.00013282258,0.000077827,0.00006826562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012142971,0.00011736709,0.00014648875,0.000103182494,0.00010915868,0.00009493567,0.00012581002,0.000049615322,0.00055590563],"category_scores_gemma":[0.00009338376,0.00009336398,0.00004986293,0.0003385267,0.00006182563,0.00010059125,0.00009301351,0.00012021424,0.00007808663],"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.000048683163,0.00008513494,0.00066338514,0.00003608403,0.000006476353,0.000052440508,0.00028442557,0.9650564,0.010515056,0.019342044,0.00038784498,0.003522014],"study_design_scores_gemma":[0.0008072815,0.000119400924,0.024190307,0.00019602447,0.000011065001,0.000045514553,0.00020395863,0.65374416,0.01090341,0.30898634,0.00034504518,0.00044750632],"about_ca_topic_score_codex":0.0000127765625,"about_ca_topic_score_gemma":0.000008188661,"teacher_disagreement_score":0.31131226,"about_ca_system_score_codex":0.000036942332,"about_ca_system_score_gemma":0.000107393986,"threshold_uncertainty_score":0.6086777},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4425662,0.0004983173,0.55178237,0.0020453539,0.0007167341,0.000346197,0.000060376784,0.000058156256,0.0019263161],"genre_scores_gemma":[0.9938791,0.0000035633811,0.0050360993,0.0007086043,0.00003891323,0.000050693823,0.00019353187,0.0000068790846,0.00008263023],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769276,0.00034240008,0.0004572534,0.00031554405,0.0009851445,0.00020688961],"domain_scores_gemma":[0.9987222,0.00066963653,0.00018219255,0.00028223934,0.0001027772,0.000040971707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010614231,0.00013613378,0.00019186102,0.00054747344,0.00023609966,0.00007105536,0.0011299098,0.000027427413,0.00008484447],"category_scores_gemma":[0.000054829623,0.00012083284,0.00010569502,0.0026796395,0.000045380257,0.00025745563,0.00033654613,0.00027334012,0.000008241244],"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.00001980202,0.00028257183,0.00204696,0.000020427333,0.000025248577,0.000019299663,0.0017325868,0.53528684,0.00006814589,0.45267472,0.0011946961,0.006628687],"study_design_scores_gemma":[0.0017813811,0.00075459515,0.15997028,0.000020819976,0.000017321414,0.00019689545,0.001217296,0.55131066,0.00022229766,0.27433923,0.009655343,0.0005139028],"about_ca_topic_score_codex":0.000021138743,"about_ca_topic_score_gemma":0.0000020573543,"teacher_disagreement_score":0.55131286,"about_ca_system_score_codex":0.0000676136,"about_ca_system_score_gemma":0.00012428184,"threshold_uncertainty_score":0.492742},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32280663,0.00008004596,0.67461896,0.0016405659,0.00006143183,0.00012743486,0.000018169876,0.00007830286,0.0005684398],"genre_scores_gemma":[0.9123304,0.0000034966056,0.086812645,0.0005463652,0.00014873293,0.000006412219,0.0000897283,0.000020895463,0.00004135358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998562,0.00009109378,0.00043179264,0.00029501045,0.00043275676,0.00018735515],"domain_scores_gemma":[0.99894446,0.00036597985,0.00017768695,0.0001682328,0.0001772867,0.00016634724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016288178,0.00015039604,0.00032052308,0.00013170872,0.00006231305,0.000022286802,0.00023931496,0.00008761408,0.00041585273],"category_scores_gemma":[0.00050798256,0.0001375224,0.00009748202,0.0009981687,0.00012389528,0.0004045136,0.00006063656,0.00012673475,0.00004555541],"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.00028907554,0.0006783014,0.006144868,0.00036793228,0.00028356828,0.000045889312,0.00308672,0.07289658,0.00170114,0.88285387,0.004437801,0.027214268],"study_design_scores_gemma":[0.0015621142,0.0012840496,0.010909999,0.00003747755,0.00009985406,0.000020007697,0.0026533417,0.07820573,0.0014041152,0.9011609,0.0020590564,0.00060334324],"about_ca_topic_score_codex":0.000008524942,"about_ca_topic_score_gemma":7.347444e-7,"teacher_disagreement_score":0.58952373,"about_ca_system_score_codex":0.000015942229,"about_ca_system_score_gemma":0.00006588333,"threshold_uncertainty_score":0.5608001},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66968745,0.00006277863,0.28485608,0.0007688608,0.0011727359,0.0006518233,0.000069991656,0.00029453344,0.042435747],"genre_scores_gemma":[0.90525013,0.0000025417203,0.093699925,0.00007024454,0.00020305777,0.000026772343,0.000018779392,0.00003890133,0.0006896723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985556,0.000034867222,0.00034421904,0.0003026559,0.0004892442,0.00027340156],"domain_scores_gemma":[0.997511,0.0010831716,0.00043408532,0.00063913094,0.00022661823,0.00010598019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025009539,0.00021013993,0.0003093048,0.00011429496,0.0005880982,0.00020185352,0.000592097,0.00007910425,0.00011827158],"category_scores_gemma":[0.0026653802,0.0001977412,0.00012355541,0.00010185426,0.00017233305,0.000386682,0.00028677023,0.00018407074,0.00013404],"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.000016838077,0.0000941199,0.0013932061,0.00006665541,0.000069698304,0.0000135716,0.00022688092,0.00036495153,0.00003293261,0.9951564,0.0006904241,0.0018742969],"study_design_scores_gemma":[0.00058007654,0.000045384688,0.01646521,0.000064447115,0.000029388666,0.000010230622,0.000098416735,0.0018740157,0.00023609091,0.9795048,0.000832358,0.00025953262],"about_ca_topic_score_codex":0.0000053393196,"about_ca_topic_score_gemma":0.0000013754945,"teacher_disagreement_score":0.23556265,"about_ca_system_score_codex":0.000068489724,"about_ca_system_score_gemma":0.000059109767,"threshold_uncertainty_score":0.8063652},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10499762,0.0002825602,0.8801593,0.0009455526,0.0004887289,0.00031551748,0.000023293911,0.00015206293,0.012635326],"genre_scores_gemma":[0.92234623,0.0000082267,0.07632601,0.00081773347,0.000037347625,0.000043159867,0.00015748372,0.000010343901,0.00025347562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975579,0.00026905857,0.0005469114,0.00062041124,0.0005795419,0.00042622583],"domain_scores_gemma":[0.998604,0.00055301667,0.00013590184,0.0003174296,0.00022713873,0.00016251834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005635908,0.00024130958,0.00027376274,0.00072731124,0.0002980843,0.0002388262,0.0005004055,0.00010325916,0.00026552958],"category_scores_gemma":[0.0002380998,0.00024262353,0.00012800736,0.002575515,0.000096383075,0.00063527474,0.00009527611,0.0002579637,0.00015679594],"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.0000047553226,0.00009722851,0.0017085684,0.000006664237,0.000014866612,0.000014340037,0.000097666816,0.20254089,0.00019706583,0.7938515,0.00031168066,0.0011547514],"study_design_scores_gemma":[0.0013890119,0.00017459794,0.097541824,0.000026238651,0.000009395672,0.000105978484,0.00011641734,0.28199142,0.00033061416,0.60384107,0.013825045,0.0006483621],"about_ca_topic_score_codex":0.000021662136,"about_ca_topic_score_gemma":0.000014025516,"teacher_disagreement_score":0.8173486,"about_ca_system_score_codex":0.00008873449,"about_ca_system_score_gemma":0.00021255565,"threshold_uncertainty_score":0.9893901},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4301428,0.00026610048,0.56773686,0.000767227,0.00014890126,0.00012441103,0.000012912459,0.000049361195,0.000751467],"genre_scores_gemma":[0.9045215,0.00002008493,0.09485216,0.00023814029,0.000093216746,0.0000099045155,0.00005980232,0.000009066538,0.00019609356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984052,0.00011081733,0.0004206171,0.00032866397,0.0005375514,0.00019711167],"domain_scores_gemma":[0.998544,0.00072088547,0.00020755829,0.00024080688,0.000205674,0.0000811262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037500277,0.00015674028,0.00019805002,0.00022101047,0.0005021174,0.00008397112,0.00036479614,0.000048048216,0.000037530343],"category_scores_gemma":[0.000104318926,0.00012787133,0.00009363021,0.0011105041,0.00013366969,0.0005040295,0.00019696646,0.00013321398,0.000016253853],"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.000042844178,0.0001705474,0.028379567,0.00005011103,0.00018128548,0.000021670889,0.0047654645,0.39968833,0.0005058844,0.5298302,0.0018775602,0.03448651],"study_design_scores_gemma":[0.0010736143,0.000061629304,0.40387794,0.00003983704,0.000025943164,0.00041244744,0.0002076969,0.5418955,0.00027973024,0.0495573,0.0021800047,0.00038836765],"about_ca_topic_score_codex":0.00003081486,"about_ca_topic_score_gemma":0.000002806171,"teacher_disagreement_score":0.48027292,"about_ca_system_score_codex":0.000024724712,"about_ca_system_score_gemma":0.00012671416,"threshold_uncertainty_score":0.52144414},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19102786,0.00058302534,0.8013251,0.00038492228,0.00035871603,0.00023698807,0.000020948904,0.00004397819,0.0060184672],"genre_scores_gemma":[0.96881217,0.00001327897,0.030132765,0.00081606593,0.000018453302,0.000014067088,0.000046923964,0.000007673546,0.000138579],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982042,0.00014236421,0.00042172454,0.00037324292,0.000642182,0.00021632806],"domain_scores_gemma":[0.9989725,0.00040503943,0.00015076304,0.00023915271,0.00016247337,0.000070124814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005048872,0.00015571565,0.00021061301,0.0005880783,0.00006189374,0.000037240145,0.00035531865,0.00004335437,0.00010938665],"category_scores_gemma":[0.00024505792,0.00015826095,0.00008225509,0.0016603067,0.00003581518,0.00033170145,0.000058787424,0.00011972366,0.00004481109],"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.000009028916,0.00021977523,0.0025030433,0.00008217333,0.000030673848,0.000007542821,0.00013258822,0.37356415,0.00015691861,0.61694556,0.000946097,0.0054024267],"study_design_scores_gemma":[0.0028718072,0.0004889582,0.40533063,0.00061907584,0.00001693346,0.000029708724,0.000056437202,0.1678294,0.0039160973,0.41569027,0.0022844833,0.00086621847],"about_ca_topic_score_codex":0.000005430294,"about_ca_topic_score_gemma":0.0000018705075,"teacher_disagreement_score":0.77778435,"about_ca_system_score_codex":0.00004669912,"about_ca_system_score_gemma":0.000120505974,"threshold_uncertainty_score":0.64536947},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4046828,0.00035733407,0.58764297,0.00009164475,0.00076981,0.00057733955,0.00016574332,0.00023844017,0.005473933],"genre_scores_gemma":[0.99462867,0.000004170119,0.0046019345,0.00016421721,0.000084740066,0.000040390336,0.00014234666,0.000046015368,0.00028754133],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890697,0.000056447698,0.00030125913,0.0002219758,0.00021316615,0.00030020077],"domain_scores_gemma":[0.9992546,0.00028403627,0.000028621078,0.00015856574,0.00011549483,0.00015869417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036846008,0.00020231717,0.0002375481,0.00023670141,0.00009222496,0.000049055725,0.00015189005,0.00007224401,0.0001861961],"category_scores_gemma":[0.00007914964,0.00019513557,0.00013725179,0.0007128295,0.000030482297,0.000089369656,0.000009574639,0.00009910642,0.00011671606],"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.00005828238,0.00003063323,0.00021142149,0.00012514346,0.00013561561,0.0000032262863,0.00044990092,0.753329,0.0011316069,0.24284643,0.00058954454,0.0010892379],"study_design_scores_gemma":[0.0059096375,0.0015650105,0.012982973,0.0005471093,0.00029066647,0.00011862024,0.0032161532,0.2508648,0.020220006,0.5081375,0.19267567,0.0034718518],"about_ca_topic_score_codex":0.0000019454037,"about_ca_topic_score_gemma":0.0000020755501,"teacher_disagreement_score":0.58994585,"about_ca_system_score_codex":0.000027613525,"about_ca_system_score_gemma":0.000023858165,"threshold_uncertainty_score":0.7957397},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7489755,0.00047398006,0.17760216,0.0042469166,0.0052215694,0.0011171148,0.00023212661,0.00051180774,0.061618794],"genre_scores_gemma":[0.94103146,0.000022209795,0.052800976,0.0004434036,0.00052279665,0.000057975194,0.00019072114,0.00008532186,0.004845158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981542,0.00008370855,0.00038412737,0.0002947061,0.00077670196,0.00030654058],"domain_scores_gemma":[0.99664587,0.0024140521,0.000163646,0.0003648311,0.00032893906,0.0000826541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023473581,0.00020967619,0.00023980807,0.00007222751,0.00038392103,0.000108885106,0.0002660218,0.00006832919,0.00016892704],"category_scores_gemma":[0.0017487506,0.00016077657,0.000098158256,0.00058491575,0.00007446278,0.000085112755,0.0001304918,0.00022804135,0.00022517698],"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.000053715423,0.00024059432,0.0004510321,0.00006419823,0.00017724112,0.000029401845,0.0001814332,0.0036739446,0.00007207794,0.9843317,0.005549478,0.0051751835],"study_design_scores_gemma":[0.00079353625,0.00006555715,0.001264704,0.000050755963,0.000034758858,0.00001996082,0.00035521213,0.0018825422,0.00018442457,0.9748679,0.020224443,0.00025622302],"about_ca_topic_score_codex":0.0000012344723,"about_ca_topic_score_gemma":0.0000031936497,"teacher_disagreement_score":0.19205591,"about_ca_system_score_codex":0.00007082656,"about_ca_system_score_gemma":0.00009597947,"threshold_uncertainty_score":0.65562785},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9457089,0.009301795,0.023906246,0.00906942,0.0014537253,0.00091320084,0.0011500659,0.0004505413,0.008046106],"genre_scores_gemma":[0.9857092,0.0009052634,0.0014825609,0.00079264585,0.00046029867,0.00003347974,0.00036155526,0.000051311636,0.010203689],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99703705,0.000263266,0.00065939914,0.0004663456,0.0009721118,0.00060180645],"domain_scores_gemma":[0.99440813,0.0045251856,0.00031980558,0.0003097108,0.00029025067,0.00014692992],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014595394,0.00038372277,0.00063572614,0.00083784,0.0007882018,0.00041937063,0.00041426285,0.00015357893,0.00043472764],"category_scores_gemma":[0.0009990872,0.00028483185,0.00027133644,0.0027938057,0.00072932796,0.0002815783,0.00054443994,0.00031616224,0.00038301395],"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.00022737225,0.000048720212,0.0007730621,0.0010015705,0.0006651215,0.00004400686,0.008182867,0.0076841596,0.0000020503069,0.9628822,0.015987081,0.0025017392],"study_design_scores_gemma":[0.0053365533,0.00009549951,0.008211101,0.00016740673,0.00036589056,0.00005919728,0.011837946,0.11436972,0.000010739172,0.8529982,0.0058752825,0.00067247835],"about_ca_topic_score_codex":0.00021249743,"about_ca_topic_score_gemma":0.000004591742,"teacher_disagreement_score":0.10988406,"about_ca_system_score_codex":0.000060576862,"about_ca_system_score_gemma":0.00013956113,"threshold_uncertainty_score":0.99996036},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07467135,0.00042127652,0.91000926,0.009745523,0.0026107247,0.00078127393,0.00023620257,0.00040060864,0.0011237749],"genre_scores_gemma":[0.94851136,0.000059396967,0.044945043,0.001860876,0.00062474725,0.00019427601,0.0031356567,0.000041231753,0.00062738353],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99606866,0.0002992259,0.00070060784,0.0010406473,0.0013975811,0.0004932528],"domain_scores_gemma":[0.99750817,0.0010467962,0.00031398883,0.0008089978,0.000213589,0.0001084513],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011051545,0.0004361425,0.000414951,0.0011543724,0.00023416194,0.00072481023,0.0024528946,0.00025825572,0.00002619466],"category_scores_gemma":[0.000117752636,0.00036744695,0.00025319224,0.0023526992,0.00007316348,0.00034153115,0.0014073626,0.00096694095,0.00030102345],"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.000015052137,0.00008926944,0.00057095464,0.00005730748,0.00013011075,0.00017468314,0.00096756394,0.9197561,0.000008583172,0.06347335,0.009024963,0.005732017],"study_design_scores_gemma":[0.00063955644,0.000095561096,0.0984467,0.00012994446,0.000048519498,0.00009407411,0.00012876726,0.60727626,0.00002622638,0.28991702,0.0024291622,0.000768177],"about_ca_topic_score_codex":0.000061840954,"about_ca_topic_score_gemma":0.000026899323,"teacher_disagreement_score":0.87384003,"about_ca_system_score_codex":0.0001227134,"about_ca_system_score_gemma":0.0004116557,"threshold_uncertainty_score":0.99987775},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049434368,0.0002069114,0.94297457,0.0025215247,0.00037223866,0.000120898054,0.000018644088,0.0003066923,0.004044184],"genre_scores_gemma":[0.832365,0.0000054134243,0.16620035,0.0011751279,0.000036850673,0.0000030786343,0.000062577776,0.0000054955017,0.00014611645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839616,0.000035075325,0.0002567805,0.0004363161,0.0005499272,0.00032574296],"domain_scores_gemma":[0.9991259,0.00016340669,0.00008401267,0.00037790483,0.00011457689,0.00013418923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018301708,0.0001726193,0.00017371771,0.00034654795,0.0002266766,0.00021369933,0.0009393922,0.00005220082,0.000057899906],"category_scores_gemma":[0.000038927756,0.00017054749,0.00012902303,0.0011937039,0.00006964889,0.000456003,0.00016674223,0.00018657534,0.0001390236],"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.000011325323,0.00016639578,0.0005380617,0.000010133608,0.000038054695,0.00005726136,0.00024615639,0.03242913,0.00008765217,0.77584314,0.0017830249,0.18878967],"study_design_scores_gemma":[0.00028081707,0.000115906456,0.12777494,0.000014582827,0.0000033444207,0.000040606345,0.00001136173,0.58592534,0.00001593839,0.28427574,0.0013010723,0.00024035313],"about_ca_topic_score_codex":0.000005068377,"about_ca_topic_score_gemma":0.0000012322963,"teacher_disagreement_score":0.7829306,"about_ca_system_score_codex":0.000041527306,"about_ca_system_score_gemma":0.00006092054,"threshold_uncertainty_score":0.6954725},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15691869,0.00013649702,0.83639634,0.00040357918,0.00021120248,0.00019232433,0.000018662711,0.00030514877,0.0054175365],"genre_scores_gemma":[0.62596977,0.0000047903754,0.3730882,0.00016409109,0.00009536226,0.000014710711,0.00010269009,0.000018249722,0.0005421247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997728,0.00004979808,0.0005795725,0.0006075105,0.0006323329,0.0004028047],"domain_scores_gemma":[0.9986195,0.00009255768,0.00048751917,0.0004985522,0.00017421633,0.00012765675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005720639,0.00024088123,0.0002642665,0.0003064649,0.0002297016,0.0003148393,0.0007727019,0.000047144073,0.000079945574],"category_scores_gemma":[0.00012997667,0.00020035262,0.00008705533,0.0009342941,0.00014133575,0.0016081772,0.00048294629,0.00016233239,0.00006550863],"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.00031944836,0.00079741626,0.19578859,0.00034869957,0.000978919,0.002945813,0.0138707785,0.050014704,0.000084825006,0.64339936,0.0076064235,0.08384503],"study_design_scores_gemma":[0.002487352,0.0011538096,0.3814673,0.00022942924,0.00012169343,0.00042528918,0.0017740155,0.58858466,0.0006313262,0.012613587,0.00830674,0.002204778],"about_ca_topic_score_codex":0.00016933792,"about_ca_topic_score_gemma":0.000009775828,"teacher_disagreement_score":0.63078576,"about_ca_system_score_codex":0.00003027778,"about_ca_system_score_gemma":0.00007960844,"threshold_uncertainty_score":0.8170143},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6032966,0.00026021485,0.33082077,0.016283138,0.0058446345,0.0014461641,0.00051487354,0.0012150431,0.040318575],"genre_scores_gemma":[0.9676211,0.0000016417479,0.022610411,0.0007812667,0.008434767,0.000021928898,0.00019993872,0.00005931117,0.0002696233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980039,0.000104498205,0.00034879704,0.00035848332,0.00082964054,0.00035465675],"domain_scores_gemma":[0.9978362,0.0014033067,0.00010038491,0.00020496207,0.00019085087,0.00026434666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036233885,0.00019074476,0.00025574907,0.00016673568,0.0001365831,0.000085052445,0.00039684423,0.0000901118,0.0007065681],"category_scores_gemma":[0.0013246095,0.0001805423,0.00013489198,0.0008326487,0.000119634955,0.00017997612,0.00022277134,0.0003303937,0.0007356212],"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.00029666236,0.00023204653,0.0071976613,0.0005056127,0.0002865717,0.00009579487,0.001995833,0.0032722845,0.00022169446,0.60359097,0.37978166,0.0025232397],"study_design_scores_gemma":[0.0014959914,0.0004376861,0.006639711,0.00006962505,0.0000522181,0.000022114029,0.0005745374,0.0463937,0.0002754974,0.88072973,0.06256007,0.0007491341],"about_ca_topic_score_codex":0.0000033943168,"about_ca_topic_score_gemma":6.2371566e-7,"teacher_disagreement_score":0.36432454,"about_ca_system_score_codex":0.00004291887,"about_ca_system_score_gemma":0.00007204634,"threshold_uncertainty_score":0.9455167},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036299285,0.000117521726,0.9513189,0.0014830027,0.0001530526,0.00014210484,0.00001238334,0.00017673042,0.010296994],"genre_scores_gemma":[0.92828864,0.0000070192145,0.06912898,0.002255912,0.000067407906,0.0000033337276,0.00007883454,0.000005937359,0.00016394087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988388,0.000022223066,0.00016165808,0.00036820848,0.00038901542,0.00022013248],"domain_scores_gemma":[0.99949926,0.00011138426,0.000070584945,0.00020934328,0.000042034764,0.000067390625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023901853,0.00013218353,0.0001226079,0.00021776088,0.00014969023,0.00036720527,0.00040670778,0.000025539115,0.000010742746],"category_scores_gemma":[0.00002961076,0.000121280595,0.000035939272,0.00048448207,0.000028786255,0.0006425484,0.00014893494,0.000092196286,0.00004632861],"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.0000123754135,0.000085921994,0.0015292946,0.000023781813,0.000030622192,0.000032167023,0.00015288043,0.0069166613,0.000009824722,0.7457538,0.0034973938,0.24195525],"study_design_scores_gemma":[0.0006701751,0.00014773455,0.12638134,0.00003348411,0.000008062764,0.000010357354,0.000022680586,0.7519189,0.000011994966,0.1189231,0.0015652311,0.00030694238],"about_ca_topic_score_codex":0.0000030746623,"about_ca_topic_score_gemma":3.6099058e-7,"teacher_disagreement_score":0.89198935,"about_ca_system_score_codex":0.0000151243285,"about_ca_system_score_gemma":0.000011572867,"threshold_uncertainty_score":0.49456793},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28936175,0.00006912861,0.70623606,0.0020157956,0.00026671233,0.00042278774,0.000039949624,0.0007145833,0.00087323127],"genre_scores_gemma":[0.88046426,0.0000028979343,0.11820366,0.00029017398,0.00010309722,0.000055243425,0.00024126617,0.000042865344,0.0005965166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99649477,0.000090032976,0.0003017635,0.00089713366,0.0015341239,0.0006821551],"domain_scores_gemma":[0.99792403,0.00053328776,0.0001188773,0.000655945,0.0005596798,0.00020817306],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005925996,0.0002784349,0.00025261202,0.00066602277,0.00041120104,0.00021562923,0.000959572,0.00006401953,0.00008038095],"category_scores_gemma":[0.00012245832,0.00023344175,0.00008957625,0.006735248,0.0003142295,0.00078752957,0.00055852043,0.0003242951,0.00095936],"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.00016656888,0.00014496835,0.017511668,0.00007634261,0.00022736691,0.0002627417,0.00023788096,0.2705827,0.00019275733,0.69697803,0.0058230017,0.0077959714],"study_design_scores_gemma":[0.0011084324,0.00020945816,0.11414343,0.000055384327,0.000010681258,0.00012387516,0.00004232636,0.15380448,0.00025334023,0.72824264,0.0013494736,0.0006564936],"about_ca_topic_score_codex":0.000015548314,"about_ca_topic_score_gemma":0.000010049021,"teacher_disagreement_score":0.59110254,"about_ca_system_score_codex":0.000056764242,"about_ca_system_score_gemma":0.0002865812,"threshold_uncertainty_score":0.9998185},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9612181,0.000038155693,0.020410001,0.0036653837,0.00008751929,0.0005413741,0.00010114477,0.00018086117,0.013757453],"genre_scores_gemma":[0.99379414,0.0000048152624,0.0050335024,0.0003145121,0.00006130049,0.00009482933,0.00017998656,0.000015810454,0.0005010903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989395,0.00005548075,0.00032130728,0.00016299378,0.00033687736,0.00018382625],"domain_scores_gemma":[0.9979153,0.0017032189,0.00009066713,0.00022356886,0.000035338835,0.000031855423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059452734,0.000104449355,0.00015406162,0.00019962575,0.00008760691,0.000054356296,0.00030325,0.00003787152,0.00014875941],"category_scores_gemma":[0.00021532743,0.000074513715,0.000067811845,0.0009617792,0.000043866556,0.000044004526,0.00006458896,0.00013078978,0.0003717346],"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.0000072301928,0.00018454244,0.0018012126,0.00018542568,0.00005509449,0.000022015418,0.0035596478,0.0027414213,0.000048556194,0.86263293,0.1270865,0.0016753846],"study_design_scores_gemma":[0.00037620313,0.000026466321,0.02281198,0.00006209965,0.000016743174,0.000018177008,0.0013584597,0.032723047,0.000016493605,0.934146,0.008252704,0.00019162618],"about_ca_topic_score_codex":0.0000075813955,"about_ca_topic_score_gemma":0.000006196641,"teacher_disagreement_score":0.11883381,"about_ca_system_score_codex":0.0000148954405,"about_ca_system_score_gemma":0.000018863824,"threshold_uncertainty_score":0.47780204},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9943387,0.0002063424,0.0018268282,0.0019271494,0.00009564132,0.0002379947,0.000947472,0.000034823894,0.0003850562],"genre_scores_gemma":[0.9983561,0.000004034583,0.0009145485,0.00018551182,0.000089427704,0.000027563186,0.00031871343,0.000007764309,0.00009631948],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99882597,0.00012788946,0.00024729347,0.00020242984,0.0003767745,0.00021965985],"domain_scores_gemma":[0.9991375,0.0005067968,0.00006761745,0.00018585073,0.00006669275,0.000035546862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033455415,0.00010806211,0.00014061674,0.0000496611,0.00020885846,0.000107868495,0.00042091202,0.00003464344,0.00054233114],"category_scores_gemma":[0.000074336356,0.000060225346,0.000055987097,0.00096654665,0.00012053018,0.000098281525,0.00012918947,0.00008840803,0.00010664904],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003719386,0.00014942061,0.119182244,0.00019281796,0.000116606294,0.00004707564,0.016051177,0.70021206,0.06368544,0.04696263,0.03828861,0.0147399865],"study_design_scores_gemma":[0.00037878437,0.00010415275,0.8787119,0.00012199722,0.000025189278,0.000008578293,0.0056642094,0.0033546344,0.0028377317,0.1000393,0.008478227,0.00027531842],"about_ca_topic_score_codex":0.0017076306,"about_ca_topic_score_gemma":0.00022882369,"teacher_disagreement_score":0.75952965,"about_ca_system_score_codex":0.000016426697,"about_ca_system_score_gemma":0.00004816912,"threshold_uncertainty_score":0.59381455},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30885836,0.00005064424,0.67121184,0.013033047,0.00037344353,0.0005422557,0.000020965681,0.00038012254,0.0055293],"genre_scores_gemma":[0.99595135,0.0000055650316,0.0031482961,0.00043212983,0.000017947614,0.000009458329,0.000010845572,0.0000072717808,0.0004171035],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987315,0.00017811176,0.00020329161,0.0002257091,0.00048465707,0.00017675238],"domain_scores_gemma":[0.9984844,0.0009859763,0.00011453935,0.00024911953,0.0001254541,0.000040533614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006267375,0.000094600415,0.000102906226,0.00017693915,0.00036008513,0.00014497648,0.0004898853,0.000027071274,0.00002729268],"category_scores_gemma":[0.00031111977,0.00005453084,0.000067509056,0.0019603525,0.000096214564,0.0001467514,0.0002971032,0.00014828816,0.000025776277],"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.0000038528833,0.000013625768,0.0027647254,0.000010211773,0.00003725812,0.0000015773758,0.0011789842,0.5396919,0.00007696398,0.45308173,0.0011149411,0.0020241896],"study_design_scores_gemma":[0.00014340645,0.000017930137,0.079691075,0.00003197892,0.0000030773397,0.0000027563794,0.000093840856,0.87912613,0.00006106273,0.0406906,0.000063545434,0.00007460337],"about_ca_topic_score_codex":0.000009621615,"about_ca_topic_score_gemma":0.0000010461324,"teacher_disagreement_score":0.687093,"about_ca_system_score_codex":0.000009969375,"about_ca_system_score_gemma":0.000049240818,"threshold_uncertainty_score":0.276952},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9950051,0.000025403397,0.002971484,0.00032247326,0.00012787107,0.00023284076,0.00028712163,0.00007181718,0.0009559064],"genre_scores_gemma":[0.99564886,0.0000040734503,0.0037761286,0.000208832,0.00006220984,0.0000032180155,0.00008317089,0.000026285828,0.00018722321],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872214,0.00007950398,0.00025936993,0.00020070378,0.0005518082,0.00018645034],"domain_scores_gemma":[0.9974735,0.0019380226,0.0001626218,0.0002669046,0.000116686366,0.000042281827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021731584,0.00016216011,0.00021846428,0.00023401866,0.00023292519,0.000024557554,0.00026922824,0.000060531773,0.00026187784],"category_scores_gemma":[0.00028883037,0.00008896693,0.000092903174,0.0009079685,0.00017941314,0.000041165844,0.000086344786,0.00017814589,0.000011214711],"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.00010615429,0.000016433578,0.00065638305,0.00005375459,0.0001244767,0.0000063474445,0.00041574214,0.011108642,0.00005650265,0.98422503,0.0029826537,0.00024788352],"study_design_scores_gemma":[0.00043175358,0.0001175526,0.018834239,0.000054361964,0.000029487393,0.000007395573,0.00034935045,0.0058879927,0.0004776263,0.9734897,0.0001753392,0.00014520578],"about_ca_topic_score_codex":0.0000025996858,"about_ca_topic_score_gemma":0.0000015256238,"teacher_disagreement_score":0.018177856,"about_ca_system_score_codex":0.000013417797,"about_ca_system_score_gemma":0.000032990316,"threshold_uncertainty_score":0.3627966},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94038296,0.000026697087,0.057663318,0.00010770624,0.00032070818,0.00033954973,0.00010516292,0.00024043892,0.0008134572],"genre_scores_gemma":[0.9686549,0.0000030803262,0.03079251,0.00004244156,0.00011814421,0.000010327383,0.00016888102,0.000050554343,0.00015916061],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980822,0.000054406566,0.0005813374,0.00028047114,0.00068140985,0.0003201718],"domain_scores_gemma":[0.99648976,0.00241856,0.00045326696,0.00026685235,0.0002888028,0.00008277162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003935287,0.00023089087,0.0005051572,0.00045924273,0.00012360791,0.00003716112,0.000254009,0.000060868297,0.000046041998],"category_scores_gemma":[0.0010646239,0.00020213341,0.000078285135,0.0014231019,0.000113591974,0.0001297102,0.00013867156,0.00013381673,0.00006370114],"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.0006317128,0.0009778081,0.04297394,0.0042432942,0.0017182779,0.000180466,0.004584119,0.022463595,0.0026301893,0.90586114,0.0046179737,0.009117471],"study_design_scores_gemma":[0.003566601,0.0006230362,0.06777193,0.0008987335,0.0002638406,0.00006553171,0.0016881833,0.031649157,0.0017621682,0.8901231,0.0004660185,0.0011216511],"about_ca_topic_score_codex":0.000004639805,"about_ca_topic_score_gemma":5.264128e-7,"teacher_disagreement_score":0.028271936,"about_ca_system_score_codex":0.000046853816,"about_ca_system_score_gemma":0.000058229416,"threshold_uncertainty_score":0.8242761},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22273275,0.00004961614,0.7612244,0.002500482,0.00019183221,0.00028312317,0.000044265213,0.0011020197,0.011871503],"genre_scores_gemma":[0.90669507,0.0000014560669,0.092575,0.00032759167,0.000023161878,0.000023798153,0.000037952184,0.000015547468,0.00030039967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987737,0.000040300383,0.0002640756,0.00029453382,0.00040543766,0.00022194094],"domain_scores_gemma":[0.9983496,0.0009276989,0.00013786281,0.00034939044,0.00018699442,0.000048445272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034260194,0.00015327382,0.00016759826,0.00023459074,0.00011584095,0.00029773367,0.0008911049,0.00004076247,0.000036464142],"category_scores_gemma":[0.00033162456,0.00010791669,0.000099338846,0.0016126622,0.00014014484,0.00045801935,0.00035494263,0.000115933915,0.00016295882],"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.00008361188,0.00035397027,0.009975358,0.00020180459,0.0002763479,0.000044739518,0.0012465299,0.007469628,0.003386969,0.82328224,0.01047088,0.14320794],"study_design_scores_gemma":[0.00035011448,0.00013598787,0.025523264,0.00011217301,0.000012002796,0.000019246352,0.00007711197,0.62310046,0.014100082,0.3356779,0.00052350573,0.00036816683],"about_ca_topic_score_codex":0.000008119896,"about_ca_topic_score_gemma":1.3961184e-7,"teacher_disagreement_score":0.68396235,"about_ca_system_score_codex":0.0000147388055,"about_ca_system_score_gemma":0.000066045446,"threshold_uncertainty_score":0.4400715},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09868853,0.00049188617,0.8956712,0.00062440144,0.0005917773,0.00019477142,0.000045623703,0.00019939589,0.0034924052],"genre_scores_gemma":[0.9295425,0.000012762076,0.06957312,0.00012401672,0.00013217462,0.000019017025,0.00022099429,0.000016004064,0.00035942375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978544,0.00007667713,0.00044797192,0.0005211519,0.0008562069,0.00024357639],"domain_scores_gemma":[0.99870133,0.000423423,0.00013923143,0.00022391317,0.0004138348,0.00009823403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033148835,0.00022109762,0.00025271357,0.0004714932,0.00014200287,0.0002580893,0.00033961632,0.00006641759,0.00016365702],"category_scores_gemma":[0.00004224087,0.00019246862,0.00011483028,0.0012604459,0.0001791969,0.00084992027,0.00013167385,0.00014951249,0.00010290378],"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.000058681042,0.00013293668,0.0013369166,0.00022756324,0.00027325982,0.00009290015,0.0013058713,0.118718855,0.00071712525,0.8336001,0.0017294413,0.04180635],"study_design_scores_gemma":[0.0009306972,0.00031068633,0.019891603,0.0002724237,0.00006557475,0.0002666155,0.00017556791,0.89120454,0.0024786876,0.0777656,0.005968257,0.0006697766],"about_ca_topic_score_codex":0.00001323081,"about_ca_topic_score_gemma":0.0000029240102,"teacher_disagreement_score":0.83085394,"about_ca_system_score_codex":0.000058432262,"about_ca_system_score_gemma":0.0002943204,"threshold_uncertainty_score":0.78486425},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90165454,0.0029888153,0.088376075,0.002456544,0.00017866069,0.0003224431,0.0013115361,0.00004311479,0.002668269],"genre_scores_gemma":[0.9989969,0.000023685681,0.0005210171,0.00010536563,0.000060091494,0.000008382555,0.000052496933,0.000014868792,0.00021716027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987221,0.00005969291,0.00038182936,0.00017798791,0.0004946934,0.00016374138],"domain_scores_gemma":[0.9955393,0.0040372917,0.00014626645,0.00013525362,0.00010813299,0.000033733377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005246845,0.00013732261,0.00024512265,0.00019072629,0.00010849659,0.00006510729,0.00021509339,0.000040833285,0.00007969106],"category_scores_gemma":[0.00036151792,0.00007840036,0.00009118557,0.00065635116,0.00018370071,0.000090440364,0.000049701604,0.0001707171,0.0000049252412],"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.00004523072,0.00002422195,0.0011814657,0.0008530974,0.00023417141,0.000004413983,0.00072445936,0.00011738079,0.00001836641,0.9949777,0.0013141824,0.00050530594],"study_design_scores_gemma":[0.00028288894,0.00019210376,0.008610415,0.00042281093,0.00009871789,0.0000066679954,0.0011174325,0.0090191895,0.0003123512,0.97788477,0.0018651221,0.0001875527],"about_ca_topic_score_codex":0.000008404852,"about_ca_topic_score_gemma":5.229314e-7,"teacher_disagreement_score":0.09734239,"about_ca_system_score_codex":0.00001917988,"about_ca_system_score_gemma":0.00006489101,"threshold_uncertainty_score":0.3197074},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003715339,0.0005358513,0.9835706,0.0018249842,0.00048139418,0.0003297528,0.00005146586,0.0011953827,0.008295274],"genre_scores_gemma":[0.6407712,0.0000033779356,0.35789874,0.00038879318,0.00010463135,0.00003888411,0.000096932614,0.000030240473,0.0006672182],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980491,0.000030439176,0.00034928657,0.000691256,0.0004898285,0.00039013376],"domain_scores_gemma":[0.99854493,0.00042096688,0.00009199065,0.00054235134,0.0002806959,0.00011905703],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00035626953,0.00023991938,0.00023203535,0.00034624824,0.00026764226,0.0033887625,0.0013835748,0.000063814216,0.000031875305],"category_scores_gemma":[0.00013761615,0.00022229512,0.00015855841,0.00087274745,0.0001556603,0.0019343514,0.0007045829,0.00014299771,0.00010694714],"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.000029964054,0.00008584688,0.00059020356,0.0003600494,0.00013250402,0.000039732164,0.00023071437,0.0028937175,0.0008573838,0.921793,0.021601476,0.05138543],"study_design_scores_gemma":[0.00016841438,0.00011458789,0.002505425,0.00011067568,0.000013204238,0.0000459237,0.000015860598,0.5158618,0.0004976441,0.47258443,0.0077810735,0.00030094947],"about_ca_topic_score_codex":0.000011264529,"about_ca_topic_score_gemma":6.9948925e-7,"teacher_disagreement_score":0.6370559,"about_ca_system_score_codex":0.00007074244,"about_ca_system_score_gemma":0.0001578161,"threshold_uncertainty_score":0.9976458},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014820645,0.002534411,0.9753257,0.00092474406,0.0024204347,0.00027131586,0.0006357368,0.00025592613,0.0028111085],"genre_scores_gemma":[0.96381724,0.000061901235,0.033672284,0.00015047369,0.00045830142,0.0000108660115,0.0003491693,0.000036109675,0.0014436363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99672323,0.00030085468,0.0008107953,0.000777295,0.00093230867,0.00045548694],"domain_scores_gemma":[0.9975041,0.0011779001,0.00025422557,0.00046274182,0.00038618591,0.00021484586],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009239767,0.0003491002,0.00043494362,0.000631807,0.00029870914,0.0004059075,0.0008565136,0.00020172473,0.00039167554],"category_scores_gemma":[0.00016405413,0.00035062458,0.0003785255,0.0029164224,0.00026818994,0.00074197113,0.00040782997,0.00040062782,0.00038955588],"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.000017827157,0.0002620106,0.0005709856,0.0006789076,0.0004262293,0.00008678396,0.0021323022,0.094175376,0.000097691605,0.84748363,0.0025568176,0.05151146],"study_design_scores_gemma":[0.00026287016,0.00010110191,0.0052102534,0.00026647697,0.000073649084,0.00003352128,0.000064758344,0.8508519,0.00013863276,0.13727224,0.005340226,0.00038437854],"about_ca_topic_score_codex":0.000101220015,"about_ca_topic_score_gemma":0.000002586371,"teacher_disagreement_score":0.9489966,"about_ca_system_score_codex":0.00011396302,"about_ca_system_score_gemma":0.00038470913,"threshold_uncertainty_score":0.99989456},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06431068,0.0007150058,0.9283938,0.0018750541,0.0006457394,0.00021153338,0.00002358382,0.00007984197,0.0037448015],"genre_scores_gemma":[0.98528284,0.000017054399,0.013129808,0.00063332095,0.000074930795,0.000019085439,0.00011111729,0.0000070628193,0.0007247704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826634,0.00010741537,0.00047428292,0.00037105905,0.00049490674,0.00028601766],"domain_scores_gemma":[0.99824977,0.0007836978,0.00017106422,0.00038739445,0.0003406585,0.000067412126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043934112,0.0001694217,0.0001874394,0.00039397317,0.00041403365,0.00018934665,0.00080466457,0.000056230016,0.00001674471],"category_scores_gemma":[0.00013176953,0.00013525285,0.00015110697,0.0018728091,0.000106898515,0.0003165754,0.00032313014,0.0001385581,0.000027040642],"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.000037590915,0.00013268334,0.0033580607,0.00004319555,0.00013191806,0.0000028158606,0.0001491321,0.11972484,0.0002718597,0.7760232,0.0074479277,0.09267675],"study_design_scores_gemma":[0.0012278513,0.00012308868,0.11763789,0.00006032641,0.00002446196,0.000015988066,0.000081119906,0.58792084,0.0016737906,0.24959746,0.041258264,0.00037893295],"about_ca_topic_score_codex":0.000015502279,"about_ca_topic_score_gemma":0.0000051552756,"teacher_disagreement_score":0.92097217,"about_ca_system_score_codex":0.00005272185,"about_ca_system_score_gemma":0.00023682584,"threshold_uncertainty_score":0.55154514},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03343524,0.00036700725,0.96033084,0.003296496,0.00017720851,0.00021460936,0.00012791817,0.00014147462,0.0019092152],"genre_scores_gemma":[0.914184,0.000006164458,0.08449617,0.00079674734,0.000029773833,0.000039504936,0.00012487278,0.0000037620966,0.00031900595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99821144,0.00008511423,0.00034461083,0.00065764895,0.00036649173,0.0003346725],"domain_scores_gemma":[0.99779665,0.0012847882,0.00009430004,0.0004654942,0.00025649872,0.00010225467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005535773,0.00017780208,0.00028055918,0.0005568231,0.00029254443,0.00021770809,0.0011327461,0.00006947063,0.00008448901],"category_scores_gemma":[0.0006226362,0.00014222502,0.00028374998,0.003584985,0.0001747072,0.00034871997,0.0003731338,0.00011668927,0.0000232244],"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.000027943106,0.0001483769,0.005149411,0.000051018804,0.0001538402,0.000002789944,0.00012241825,0.0053203744,0.000047738657,0.9520402,0.0010612461,0.035874654],"study_design_scores_gemma":[0.0007680384,0.00015424729,0.07753077,0.00002753352,0.00006656036,0.000004094961,0.00032833964,0.34316245,0.00038779422,0.5707606,0.006391754,0.00041779323],"about_ca_topic_score_codex":0.000020118345,"about_ca_topic_score_gemma":0.0000031859483,"teacher_disagreement_score":0.88074875,"about_ca_system_score_codex":0.00005628001,"about_ca_system_score_gemma":0.0001063143,"threshold_uncertainty_score":0.5799768},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38210276,0.0026965197,0.5983837,0.0005268396,0.0063215834,0.001158941,0.00020397817,0.00024271925,0.00836291],"genre_scores_gemma":[0.97549456,0.00006769275,0.020923652,0.00019791091,0.00018835788,0.00003909571,0.00016168194,0.000084223844,0.0028427928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958455,0.0002596546,0.0016910271,0.0006629914,0.00097155996,0.0005692806],"domain_scores_gemma":[0.99412435,0.0029688505,0.0010809578,0.00075630675,0.0009148765,0.00015468197],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00068980583,0.00060747936,0.0011742826,0.0008680447,0.000301339,0.000116468604,0.0006327518,0.0003781122,0.0001991126],"category_scores_gemma":[0.001679119,0.000647028,0.0004424536,0.0025858544,0.0002766197,0.00027719655,0.00043335021,0.00050113007,0.00006388348],"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.0001902012,0.000677885,0.0018970988,0.0015072534,0.00065363623,0.0000062580675,0.00037702147,0.008415297,0.00017147156,0.9830554,0.0018662637,0.0011821884],"study_design_scores_gemma":[0.0025938305,0.00023827677,0.0032141644,0.0007092473,0.00053656154,0.000004992251,0.00037028894,0.019248098,0.0006422588,0.9694028,0.0025169344,0.00052254234],"about_ca_topic_score_codex":0.000026606527,"about_ca_topic_score_gemma":0.000001990222,"teacher_disagreement_score":0.59339184,"about_ca_system_score_codex":0.00028820266,"about_ca_system_score_gemma":0.00035122395,"threshold_uncertainty_score":0.9995981},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7412863,0.00020113688,0.244556,0.00027312696,0.00012591854,0.00015261091,0.00008673038,0.00006431573,0.013253877],"genre_scores_gemma":[0.9869302,0.0000036250212,0.012466591,0.00015638782,0.00003279836,0.00000796391,0.000045707533,0.000009351973,0.00034740096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986032,0.000052031108,0.00054494914,0.00022093965,0.0003682986,0.00021055793],"domain_scores_gemma":[0.9973392,0.001886776,0.00017392971,0.00021162372,0.0003482028,0.000040294773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055767305,0.00013647367,0.00031632985,0.00046119592,0.00009068785,0.000027268998,0.00019506368,0.000059236805,0.0002980911],"category_scores_gemma":[0.0013798866,0.00012485545,0.00012296875,0.0015940827,0.000086445914,0.00012047899,0.000119718745,0.00011470677,0.0000061279557],"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.000043680906,0.00015166501,0.009890924,0.0012804859,0.00014450957,0.0000014659663,0.0005450728,0.0014024335,0.00006374463,0.9803097,0.0013786991,0.004787612],"study_design_scores_gemma":[0.0004778693,0.000049892857,0.015242993,0.00010871916,0.00004489145,0.0000017604748,0.0012258333,0.0060061924,0.0014586789,0.9740868,0.0011057891,0.0001905717],"about_ca_topic_score_codex":0.000049253023,"about_ca_topic_score_gemma":0.000004402853,"teacher_disagreement_score":0.2456439,"about_ca_system_score_codex":0.000046002184,"about_ca_system_score_gemma":0.00012750464,"threshold_uncertainty_score":0.50914574},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64498,0.00014588334,0.3462783,0.00040597483,0.00026843257,0.00022318731,0.00010023725,0.000051015377,0.0075469464],"genre_scores_gemma":[0.9777076,0.000004236807,0.020018417,0.00009445463,0.00004422043,0.000025869975,0.00003156241,0.00000915956,0.0020644427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910915,0.0000414407,0.00036108622,0.0001657645,0.00019284704,0.00012973096],"domain_scores_gemma":[0.9987226,0.00086504687,0.00011036206,0.00013396458,0.00011081812,0.000057204616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021679519,0.000105927174,0.00022162362,0.00015754161,0.00014946591,0.00004302746,0.000058737944,0.000056338933,0.00055298384],"category_scores_gemma":[0.00027500204,0.000099520876,0.0000807699,0.00038119382,0.00012238321,0.000077660115,0.000048892438,0.00008555627,0.000018020079],"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.00006737892,0.00024065682,0.005605853,0.0005440789,0.0001968746,0.0000017049498,0.00027168135,0.0014320823,0.00037758332,0.9774374,0.011038315,0.0027864296],"study_design_scores_gemma":[0.0009769427,0.00013863282,0.0651394,0.00035037872,0.00019586168,0.000015648375,0.00033795886,0.026559087,0.00027123804,0.90251344,0.003224823,0.00027657553],"about_ca_topic_score_codex":0.000020323941,"about_ca_topic_score_gemma":0.0000055907103,"teacher_disagreement_score":0.3327276,"about_ca_system_score_codex":0.000023841569,"about_ca_system_score_gemma":0.00006001769,"threshold_uncertainty_score":0.6054785},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24841386,0.0070180064,0.71940583,0.0031268783,0.00030797438,0.00023841606,0.000026107267,0.000115954994,0.021346968],"genre_scores_gemma":[0.99041814,0.000032434153,0.006795099,0.0007761651,0.000082689534,0.00001422144,0.000040085117,0.000010735267,0.0018304568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988305,0.00008793767,0.00031782239,0.00024572274,0.00033996964,0.00017804997],"domain_scores_gemma":[0.99794924,0.0015662316,0.00011369537,0.00019374143,0.00013260984,0.00004450315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003667817,0.0001551388,0.00030552674,0.00026512006,0.00023216126,0.00013082183,0.00019487964,0.000067205,0.00016565422],"category_scores_gemma":[0.00044377585,0.00009797201,0.0001563519,0.001487781,0.00015393476,0.00008696029,0.00011672993,0.00014101045,0.000004530674],"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.000049511644,0.000031962532,0.0034205422,0.00003724922,0.00031638637,0.0000024295082,0.00009457626,0.0072431164,0.000001659867,0.9737759,0.005688615,0.009338031],"study_design_scores_gemma":[0.0013361538,0.000013978606,0.009043326,0.000048450704,0.00019605749,0.000005337325,0.00082687614,0.08698974,0.000010391758,0.89366,0.007687269,0.0001824068],"about_ca_topic_score_codex":0.00009157225,"about_ca_topic_score_gemma":0.000039456987,"teacher_disagreement_score":0.7420043,"about_ca_system_score_codex":0.00001775756,"about_ca_system_score_gemma":0.000039409486,"threshold_uncertainty_score":0.39951825},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24213894,0.0002598081,0.7545662,0.0015585553,0.00053136336,0.00013563347,0.00007768372,0.00022246195,0.0005093454],"genre_scores_gemma":[0.8912043,0.000012094766,0.10730868,0.00061726273,0.00031073013,0.000020598512,0.00015495432,0.000018467386,0.000352925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99737215,0.00013096069,0.00047488304,0.0007626382,0.00084258517,0.0004167741],"domain_scores_gemma":[0.9978331,0.001032767,0.00019791588,0.00043299282,0.00028966495,0.00021360216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036151352,0.00027594718,0.00025655853,0.00048595495,0.00026306222,0.00024709778,0.0007849409,0.00009030143,0.000261164],"category_scores_gemma":[0.00016726169,0.00021635187,0.00016000132,0.0012482925,0.00007273858,0.0011749959,0.00031432233,0.00012128843,0.00048397022],"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.000086230444,0.00028053691,0.0105802985,0.000032027896,0.0003788491,0.00007938722,0.0007240212,0.11113151,0.009395415,0.57028484,0.0065096314,0.29051727],"study_design_scores_gemma":[0.0027923512,0.00024568755,0.17248638,0.00018782938,0.00004120897,0.00004522361,0.000056265126,0.37998438,0.0038736875,0.42207155,0.01681526,0.0014001857],"about_ca_topic_score_codex":0.0000423062,"about_ca_topic_score_gemma":0.0000049120663,"teacher_disagreement_score":0.6490654,"about_ca_system_score_codex":0.00013146384,"about_ca_system_score_gemma":0.0001927224,"threshold_uncertainty_score":0.8822573},"labels":[],"label_agreement":null}]}