{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":172,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":172,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"a7a88dbf5485","filters":{"venue":"Discrete & Computational Geometry"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"David Avis","is_ca":true},{"name":"Erik D. Demaine","is_ca":false},{"name":"Jeff Erickson","is_ca":false},{"name":"John Iacono","is_ca":false},{"name":"Stefan Langerman","is_ca":false},{"name":"Pat Morin","is_ca":true},{"name":"Godfried Toussaint","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02113207701903566,"gpt":0.2978808491474306,"spread":0.2767487721283949,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00482629,0.001228619,0.002216626,0.001912105,0.001456076,0.002933954,0.003945647,0.002496717,0.006467793],"category_scores_gemma":[0.02609133,0.001011947,0.001021929,0.002036292,0.001371673,0.003007807,0.004072119,0.003074788,0.001606115],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001881532,"about_ca_system_score_gemma":0.001879364,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003977254,"about_ca_topic_score_gemma":0.004708797,"domain_scores_codex":[0.9961483,0.001129212,0.0003262533,0.0005813779,0.001565832,0.0002489666],"domain_scores_gemma":[0.9866394,0.009012174,0.0005362732,0.001389252,0.002187992,0.0002348067],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006126647,0.0002231292,0.001369416,0.0002439335,0.00009033246,0.00009443065,0.0002395411,0.4753016,0.004222755,0.041286,0.004565534,0.4717507],"study_design_scores_gemma":[0.0000213441,0.0000290125,0.0001229186,0.00001399053,0.0000118996,0.00002592018,0.0000183578,0.9759057,0.002617449,0.02060439,0.0006186398,0.00001029732],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006086241,0.0001392936,0.9920345,0.0000663906,0.00003913838,0.00005425427,0.00006011784,0.000744778,0.00077529],"genre_scores_gemma":[0.2171212,0.0001496074,0.7786116,0.000186187,0.00007193751,0.0002715776,0.0005829132,0.0004271852,0.002577822],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006467793,"threshold_uncertainty_score":0.0255242,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Timothy M. Chan","is_ca":true},{"name":"Sariel Har-Peled","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03693149263006409,"gpt":0.3046274523030603,"spread":0.2676959596729963,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003918263,0.00241582,0.003267406,0.002900626,0.001439438,0.003886797,0.00747471,0.003210488,0.009539285],"category_scores_gemma":[0.02948612,0.001959443,0.002628915,0.005033333,0.002161455,0.007089947,0.006274132,0.005702548,0.002185082],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003433702,"about_ca_system_score_gemma":0.002329979,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00285183,"about_ca_topic_score_gemma":0.003351307,"domain_scores_codex":[0.9969904,0.001261808,0.0001586173,0.000443564,0.0008731766,0.0002723231],"domain_scores_gemma":[0.9862794,0.009956959,0.0004989268,0.001725174,0.001018567,0.0005209208],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00054613,0.0002319761,0.0007613712,0.000590838,0.000160456,0.00008249648,0.0003074505,0.6392685,0.0009997018,0.2323533,0.01312521,0.1115726],"study_design_scores_gemma":[0.00005198746,0.00002733205,0.00008143929,0.00003297875,0.00002153771,0.00003335725,0.00003476977,0.8704271,0.0003745443,0.1274778,0.001425179,0.00001198293],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00784892,0.0008000635,0.9852704,0.0004734094,0.0001435991,0.0001058277,0.0002587551,0.0004639469,0.004635078],"genre_scores_gemma":[0.1892964,0.001205308,0.7994962,0.0003424931,0.0003349085,0.0006854766,0.001321295,0.0006345683,0.006683321],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009539285,"threshold_uncertainty_score":0.03191203,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Christophe Hohlweg","is_ca":true},{"name":"Carsten E. M. C. Lange","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02074767812952066,"gpt":0.3293440776650637,"spread":0.3085963995355431,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003929012,0.0003663204,0.0005822201,0.001088232,0.001776986,0.00302569,0.0006919585,0.00100533,0.009999617],"category_scores_gemma":[0.001104682,0.0002496547,0.0005100792,0.0008044185,0.002180389,0.002153869,0.001561031,0.001745471,0.0009341803],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001035184,"about_ca_system_score_gemma":0.000580008,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008259813,"about_ca_topic_score_gemma":0.0007728089,"domain_scores_codex":[0.9995684,0.0001111504,0.00002107246,0.00006562315,0.0001333298,0.000100362],"domain_scores_gemma":[0.9995981,0.00009982955,0.00005592229,0.00007600841,0.00007114182,0.00009906307],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000008566009,0.000003469421,0.00002590347,0.000004310203,8.949521e-7,0.00001649165,0.00002518639,0.000214686,0.000105107,0.9984762,0.0003837383,0.0007353312],"study_design_scores_gemma":[0.00001141295,0.000008639773,0.0001046831,0.000006862728,0.000002343905,0.00007233014,0.00007420297,0.002516731,0.0002151504,0.9929703,0.004009574,0.000007799246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.4079204,0.001036,0.0925051,0.002800781,0.0007630626,0.00006271635,0.0006781666,0.0002829174,0.4939509],"genre_scores_gemma":[0.9563462,0.0004504776,0.01363857,0.0003082786,0.0003558913,0.00007762354,0.0003660873,0.00005870681,0.02839816],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009999617,"threshold_uncertainty_score":0.03345203,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"József Solymosi","is_ca":true},{"name":"Terence Tao","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02467572079097737,"gpt":0.2908872514977361,"spread":0.2662115307067587,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001428984,0.0008636062,0.0009246005,0.002585793,0.001791995,0.00353585,0.0017117,0.001262542,0.01281703],"category_scores_gemma":[0.00583178,0.000660693,0.001532737,0.001841357,0.003128448,0.007502091,0.003838678,0.005347594,0.002036317],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001319026,"about_ca_system_score_gemma":0.0007253534,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001599775,"about_ca_topic_score_gemma":0.001020109,"domain_scores_codex":[0.9989746,0.0002105252,0.00006083543,0.0001718244,0.0004284432,0.0001538242],"domain_scores_gemma":[0.9976476,0.001167512,0.0002134091,0.0003138966,0.0004418734,0.0002157711],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000007123166,0.000009398348,0.0001186576,0.0000204252,0.000003264263,0.00002166388,0.00006074123,0.0006260453,0.0002302231,0.9939202,0.001381538,0.003600732],"study_design_scores_gemma":[0.000007469557,0.000009138653,0.0001575341,0.00001440347,0.00000627076,0.00007851015,0.00003584571,0.009465591,0.0003520427,0.9840735,0.005791232,0.000008586543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05830489,0.002387879,0.7380784,0.003501591,0.00179619,0.00006185411,0.0003826386,0.0003908964,0.1950956],"genre_scores_gemma":[0.7555721,0.004723688,0.1321094,0.001575081,0.003124609,0.0002202006,0.0008160244,0.0008417022,0.1010172],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01281703,"threshold_uncertainty_score":0.0428772,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Federico Ardila","is_ca":false},{"name":"Carolina Benedetti","is_ca":true},{"name":"Jeffrey Doker","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01867194026509233,"gpt":0.2980928033620706,"spread":0.2794208630969783,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004899136,0.0006494357,0.0008731609,0.003022936,0.001481081,0.004728876,0.001555061,0.0009102875,0.01273756],"category_scores_gemma":[0.002808916,0.0007540093,0.0006963123,0.002238446,0.002890866,0.005156115,0.002377764,0.003471807,0.00137956],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001160967,"about_ca_system_score_gemma":0.0003376176,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001056723,"about_ca_topic_score_gemma":0.0008797545,"domain_scores_codex":[0.9994487,0.0001120811,0.00002462017,0.00010691,0.0002302576,0.0000773129],"domain_scores_gemma":[0.9986559,0.0006221503,0.0002170027,0.0001066784,0.0001699454,0.0002281479],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001549318,0.00001103217,0.000104144,0.00003162686,0.000006389092,0.00002495767,0.0001386954,0.001457983,0.0002620651,0.9904964,0.001922871,0.005528516],"study_design_scores_gemma":[0.000008364714,0.00001117366,0.0003368056,0.00001618722,0.000007199283,0.0001330992,0.0001137225,0.005228266,0.0002511665,0.9849603,0.008924856,0.000008817608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.3848286,0.007181738,0.2338777,0.005572634,0.0006915547,0.0001700721,0.002842156,0.0004751205,0.3643604],"genre_scores_gemma":[0.8719862,0.003863328,0.03655795,0.0005637387,0.00116159,0.00028529,0.001456683,0.0003040365,0.08382124],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01273756,"threshold_uncertainty_score":0.04261142,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Sergei Bespamyatnikh","is_ca":true},{"name":"David Kirkpatrick","is_ca":true},{"name":"Jack Snoeyink","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01543526335105674,"gpt":0.2780546105862947,"spread":0.262619347235238,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000842782,0.0007580257,0.0006974818,0.001165915,0.0004755312,0.001366802,0.001070596,0.001026458,0.007265294],"category_scores_gemma":[0.004619248,0.0006419845,0.0007169467,0.0006793089,0.00109423,0.001508512,0.003105883,0.001783388,0.001193956],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004278804,"about_ca_system_score_gemma":0.0002735291,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007962855,"about_ca_topic_score_gemma":0.001779093,"domain_scores_codex":[0.9994779,0.000141886,0.00002668503,0.00009992881,0.0001937994,0.00005971405],"domain_scores_gemma":[0.9988884,0.0003950214,0.00006104248,0.0004358481,0.000173013,0.00004658669],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002196151,0.0001106044,0.0009492364,0.0001468436,0.00005918103,0.0002471567,0.000388211,0.2568709,0.02380072,0.4915071,0.003839602,0.2218608],"study_design_scores_gemma":[0.00002068055,0.00005427936,0.0002281064,0.00003057017,0.00002310151,0.0001711056,0.00008421372,0.7223194,0.008790364,0.2579315,0.01033098,0.00001575407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01603288,0.00008481458,0.9756739,0.00004504769,0.00006007261,0.0000290083,0.00003348659,0.0002720545,0.007768771],"genre_scores_gemma":[0.4182613,0.0002790549,0.5651984,0.0002083513,0.00009993421,0.0001115982,0.0002565345,0.0007881791,0.01479663],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007265294,"threshold_uncertainty_score":0.02430487,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Vida Dujmović","is_ca":true},{"name":"David R. Wood","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01927022417299054,"gpt":0.2982417351459352,"spread":0.2789715109729447,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001491004,0.0008817192,0.0009109561,0.002415881,0.001103803,0.003896941,0.002651692,0.002100869,0.01155046],"category_scores_gemma":[0.01806127,0.001289562,0.0004993408,0.003701218,0.002708276,0.01498717,0.002793647,0.003059412,0.001166977],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001303028,"about_ca_system_score_gemma":0.0005680242,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007967501,"about_ca_topic_score_gemma":0.001062204,"domain_scores_codex":[0.9990646,0.0002236338,0.00004385484,0.0002811802,0.0002078021,0.0001789229],"domain_scores_gemma":[0.9858293,0.008397751,0.002552571,0.001489858,0.0006137388,0.001116862],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005645897,0.000112869,0.01051839,0.0002242095,0.00005757055,0.0002701755,0.0007402247,0.06902786,0.01123175,0.8582587,0.005887931,0.04310566],"study_design_scores_gemma":[0.00004992752,0.0000652826,0.003859151,0.00008592439,0.00008407424,0.0008667205,0.0005630611,0.1072386,0.00664705,0.8750305,0.005442931,0.00006681837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7035707,0.003632879,0.2417851,0.002972543,0.0001839173,0.00006950011,0.00129749,0.0007723281,0.04571556],"genre_scores_gemma":[0.966036,0.001193268,0.02569509,0.0001748408,0.0001878897,0.00007765041,0.0004410085,0.0004966522,0.00569756],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01155046,"threshold_uncertainty_score":0.03864014,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Robert Connelly","is_ca":false},{"name":"Walter Whiteley","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.003043644546144334,"gpt":0.2229412836714452,"spread":0.2198976391253009,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006489497,0.001089634,0.001139869,0.001138776,0.001844238,0.002666618,0.0009774631,0.001253805,0.03214603],"category_scores_gemma":[0.003929522,0.000644977,0.0005775404,0.0009067662,0.002489673,0.002893327,0.002081584,0.001695288,0.002221073],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004901089,"about_ca_system_score_gemma":0.0006576374,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008837066,"about_ca_topic_score_gemma":0.00167652,"domain_scores_codex":[0.9993135,0.0001662823,0.00001668769,0.0001872853,0.000158325,0.0001580044],"domain_scores_gemma":[0.9976272,0.000769923,0.0002021599,0.0008176574,0.0002437921,0.0003392732],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001022727,0.0002868284,0.001788498,0.0002761639,0.00008706155,0.000700707,0.0003548781,0.1692769,0.04653,0.672044,0.009581673,0.09805063],"study_design_scores_gemma":[0.0001096384,0.0005231248,0.006299972,0.0001223524,0.0001199264,0.001032082,0.0007601635,0.4379344,0.03760727,0.493465,0.02185577,0.0001702466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4240164,0.002486444,0.2695123,0.001838052,0.001500863,0.00008119321,0.0005048151,0.001682342,0.2983776],"genre_scores_gemma":[0.9726058,0.0004965274,0.008863089,0.0001797254,0.0001491312,0.00002008966,0.0001293958,0.0006780476,0.01687831],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03214603,"threshold_uncertainty_score":0.1075392,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Robert Connelly","is_ca":false},{"name":"Erik D. Demaine","is_ca":false},{"name":"G�nter Rote","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006604200726812044,"gpt":0.2141234034690905,"spread":0.2075192027422784,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001487097,0.0004597345,0.0004475089,0.001035009,0.0007780307,0.0009073491,0.0004494283,0.0009055621,0.03164028],"category_scores_gemma":[0.00152361,0.0003787892,0.00047215,0.0004955338,0.0008269551,0.001394283,0.001680087,0.001359098,0.001470984],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002788805,"about_ca_system_score_gemma":0.0002185138,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004182278,"about_ca_topic_score_gemma":0.0006160082,"domain_scores_codex":[0.9998749,0.00001638697,0.000004717957,0.00002772393,0.00004911716,0.00002709725],"domain_scores_gemma":[0.9997609,0.00008115535,0.00002908598,0.00005692164,0.00003340387,0.00003860446],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001301614,0.00007423237,0.0005513002,0.0002805452,0.00004419684,0.001149431,0.0005163999,0.0990153,0.01892819,0.7625309,0.007653185,0.1091261],"study_design_scores_gemma":[0.00003906811,0.0002092411,0.0009140374,0.000106475,0.00003062692,0.001045031,0.000640498,0.2174544,0.007349366,0.7342772,0.0379039,0.00003014588],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.342357,0.000844607,0.4003198,0.0007757696,0.000823106,0.0001527339,0.0003345495,0.0009105121,0.253482],"genre_scores_gemma":[0.8612928,0.000599155,0.05505342,0.0002846255,0.000115643,0.00006920166,0.0002602519,0.000469243,0.08185574],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03164028,"threshold_uncertainty_score":0.1058473,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Stefan Langerman","is_ca":false},{"name":"Pat Morin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005501027611406248,"gpt":0.2283880361121284,"spread":0.2228870085007222,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007192581,0.0008360358,0.000857097,0.001424336,0.003302268,0.005442217,0.000782045,0.001593287,0.03771838],"category_scores_gemma":[0.004439026,0.000499505,0.00109405,0.002048308,0.006324387,0.01274187,0.005518472,0.003626136,0.008194515],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00112493,"about_ca_system_score_gemma":0.0006033519,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008732948,"about_ca_topic_score_gemma":0.0007568297,"domain_scores_codex":[0.9986269,0.0005060196,0.00006079721,0.0003901855,0.0002861933,0.0001297925],"domain_scores_gemma":[0.9984573,0.0004814735,0.00007352472,0.0006436139,0.0001840722,0.0001600094],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004780768,0.000001690106,0.00003955634,0.00002036203,0.000004290135,0.00002100044,0.0002318008,0.0001231741,0.00007728945,0.9857465,0.007936304,0.00579332],"study_design_scores_gemma":[0.000002335699,0.000004067328,0.00005158241,0.00001495562,0.000004973685,0.00008787535,0.0001800104,0.0002750242,0.00006742554,0.9032963,0.09601092,0.000004557359],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.01647739,0.0100048,0.2736001,0.02419771,0.004770334,0.0001055202,0.000910284,0.001091895,0.6688421],"genre_scores_gemma":[0.5626434,0.01020881,0.095575,0.009725685,0.0043922,0.0004222369,0.002336039,0.001461085,0.3132355],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03771838,"threshold_uncertainty_score":0.1261806,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Boris Aronov","is_ca":false},{"name":"Guibas","is_ca":false},{"name":"Teichmann","is_ca":true},{"name":"Zhang Zhang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01461476435847057,"gpt":0.2456649695068809,"spread":0.2310502051484104,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001853118,0.0005530218,0.001513946,0.001582443,0.001638668,0.00402345,0.002956668,0.001678261,0.004196029],"category_scores_gemma":[0.02003365,0.001171189,0.001035471,0.003492173,0.002175124,0.01168778,0.004719984,0.00164648,0.0007561179],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000913216,"about_ca_system_score_gemma":0.000824175,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00304959,"about_ca_topic_score_gemma":0.002429538,"domain_scores_codex":[0.9973884,0.0004003934,0.0002983675,0.0005703598,0.0009873852,0.0003552133],"domain_scores_gemma":[0.9866716,0.006399603,0.001293841,0.004337936,0.0008519319,0.0004451284],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002525591,0.0004978764,0.01163794,0.001056385,0.0001668421,0.001810465,0.003915447,0.111554,0.03179847,0.3860045,0.02134477,0.4276876],"study_design_scores_gemma":[0.0002002089,0.0002083468,0.002046797,0.00009346583,0.0001029039,0.0009436056,0.0008521609,0.4013346,0.02115702,0.5566775,0.01631206,0.00007128111],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2559871,0.001083651,0.7311695,0.0006720196,0.0001341489,0.0002077944,0.0009076647,0.003248619,0.006589361],"genre_scores_gemma":[0.7630158,0.0006213359,0.2280183,0.0001323914,0.0001183042,0.0001077261,0.002058331,0.000805972,0.00512179],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004196029,"threshold_uncertainty_score":0.01403707,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Richard Ehrenborg","is_ca":false},{"name":"Stephanie van Willigenburg","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.044196201473794,"gpt":0.3100833130545225,"spread":0.2658871115807285,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001142217,0.0006525083,0.0008891429,0.003497535,0.002881558,0.003636726,0.002069973,0.001318853,0.01373848],"category_scores_gemma":[0.008387593,0.0005576127,0.0008834422,0.002349699,0.002939109,0.006492353,0.002065364,0.002367005,0.0006662139],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002115926,"about_ca_system_score_gemma":0.000710899,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001780286,"about_ca_topic_score_gemma":0.002192217,"domain_scores_codex":[0.9989329,0.0002582115,0.00006770897,0.0002304223,0.0002620707,0.0002485486],"domain_scores_gemma":[0.990284,0.006534537,0.001093181,0.000944812,0.0005591335,0.000584367],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001525876,0.00009262738,0.002174364,0.00009777458,0.00002278585,0.0002055195,0.0009229526,0.003856634,0.00258284,0.9735962,0.003438269,0.01285745],"study_design_scores_gemma":[0.00003340547,0.00002896843,0.001283543,0.00002704559,0.00003426351,0.0002481714,0.0002565495,0.008812468,0.00187364,0.9840202,0.00336056,0.00002109455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8844023,0.0006219274,0.03912284,0.001952079,0.00009944245,0.00007482595,0.0008186863,0.0004041627,0.07250369],"genre_scores_gemma":[0.9730786,0.0004125768,0.009288263,0.0002838402,0.0001801719,0.00007530706,0.001030612,0.0001227472,0.01552785],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01373848,"threshold_uncertainty_score":0.04595983,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; 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","authors":[{"name":"Md. Jawaherul Alam","is_ca":false},{"name":"Thérèse Biedl","is_ca":true},{"name":"Stefan Felsner","is_ca":false},{"name":"Michael Kaufmann","is_ca":false},{"name":"Stephen Kobourov","is_ca":false},{"name":"Torsten Ueckerdt","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01722231830427899,"gpt":0.2491749199382125,"spread":0.2319526016339335,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000470736,0.0009214007,0.001431774,0.001596,0.0007421329,0.002278158,0.001262169,0.001174179,0.01182947],"category_scores_gemma":[0.006345767,0.0009329142,0.001146042,0.002217973,0.0009893813,0.002913242,0.002204777,0.001374061,0.002153106],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007542234,"about_ca_system_score_gemma":0.001164656,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003111047,"about_ca_topic_score_gemma":0.006537626,"domain_scores_codex":[0.999414,0.0001037772,0.00003595166,0.0001158773,0.0002500149,0.00008037411],"domain_scores_gemma":[0.998159,0.001080844,0.00008233604,0.0003929513,0.0001988228,0.00008602483],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003954744,0.0001218313,0.001586727,0.0004284226,0.0001166876,0.0002789205,0.0002174073,0.4707158,0.008213422,0.1304644,0.01977306,0.3676879],"study_design_scores_gemma":[0.00006684012,0.00004734452,0.0002481754,0.00002202745,0.00002766896,0.0001090804,0.000076861,0.87161,0.002777807,0.1199996,0.005001384,0.00001305229],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05334016,0.0004653735,0.932205,0.0005339626,0.0001877063,0.0001091419,0.0004937323,0.002450247,0.01021468],"genre_scores_gemma":[0.2837401,0.000485042,0.7083703,0.0001576425,0.0001199457,0.0001186273,0.00103222,0.0008856803,0.00509035],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01182947,"threshold_uncertainty_score":0.03957349,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Timothy M. Chan","is_ca":false},{"name":"Eric Chen","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01487991024149817,"gpt":0.2603200952938355,"spread":0.2454401850523374,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006335757,0.001341645,0.001194413,0.001406628,0.0008561373,0.001892464,0.002005468,0.001631325,0.0303329],"category_scores_gemma":[0.001855137,0.0008506691,0.001158191,0.001190219,0.0006114257,0.002189825,0.002999747,0.001415486,0.009391095],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005176098,"about_ca_system_score_gemma":0.0006686156,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001113404,"about_ca_topic_score_gemma":0.002174051,"domain_scores_codex":[0.9993563,0.00007886957,0.00002811302,0.0001486641,0.0003341671,0.00005382152],"domain_scores_gemma":[0.9991598,0.0001713242,0.00006844613,0.0003863474,0.0001786267,0.00003539587],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001881035,0.0001169352,0.000673344,0.0002564779,0.0001198715,0.0001513006,0.0001850201,0.1548738,0.01391356,0.1233762,0.01213651,0.6940088],"study_design_scores_gemma":[0.0000444373,0.000150607,0.0004406015,0.00004272894,0.0000569795,0.0003573852,0.00006646349,0.8897533,0.01331947,0.04537335,0.05036374,0.00003102274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001574568,0.0001180204,0.9929299,0.0000388772,0.00004514158,0.00003364326,0.00003998213,0.0007699205,0.004450062],"genre_scores_gemma":[0.071707,0.0003073832,0.9004037,0.00008881567,0.00007021323,0.0001523567,0.000305785,0.0005762692,0.02638852],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0303329,"threshold_uncertainty_score":0.1014736,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Lattice (music); Combinatorics; Substitution (logic); Partition (number theory); Discrete mathematics; Computer science; Physics","authors":[{"name":"Jeong-Yup Lee","is_ca":true},{"name":"Robert V. Moody","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04483498335996422,"gpt":0.3233671858255259,"spread":0.2785322024655617,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00121262,0.0006588126,0.001198168,0.001595889,0.001901988,0.004645101,0.001145271,0.002383922,0.009208974],"category_scores_gemma":[0.004395687,0.0005133641,0.0006980154,0.001807052,0.0052774,0.005374959,0.001766392,0.002551174,0.0008335913],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001931319,"about_ca_system_score_gemma":0.0009791953,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001456627,"about_ca_topic_score_gemma":0.001088698,"domain_scores_codex":[0.9991772,0.0003923009,0.00003472951,0.00009901502,0.0002046025,0.00009204042],"domain_scores_gemma":[0.9980941,0.001166991,0.0001712901,0.0002616554,0.000181891,0.0001239961],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000001980987,0.000002183464,0.00001140494,0.000004551981,8.711135e-7,0.000005386159,0.00002301001,0.000849794,0.00002257395,0.9985073,0.0002618866,0.0003090938],"study_design_scores_gemma":[0.000003110695,0.000001226089,0.000007596956,0.000001996977,6.844352e-7,0.000009121418,0.0000138197,0.003445376,0.00001592141,0.9956017,0.0008980774,0.000001545713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2615297,0.0126426,0.4133165,0.01918577,0.001247683,0.000130531,0.0006865861,0.0005567243,0.2907041],"genre_scores_gemma":[0.9422132,0.003059573,0.03182546,0.0006355594,0.0005281091,0.0002028574,0.0003098902,0.00009994429,0.02112535],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009208974,"threshold_uncertainty_score":0.03080708,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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)","authors":[{"name":"Bernd Schulze","is_ca":false},{"name":"Walter Whiteley","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.004093069760041351,"gpt":0.2367121928877307,"spread":0.2326191231276893,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006553431,0.0007032057,0.0006008444,0.00164781,0.00127212,0.001567675,0.001172177,0.001216354,0.01551549],"category_scores_gemma":[0.001624887,0.0003427787,0.0004670394,0.0006833152,0.002112828,0.002158509,0.001307981,0.001382373,0.001396349],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007286057,"about_ca_system_score_gemma":0.001051029,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001912904,"about_ca_topic_score_gemma":0.001672876,"domain_scores_codex":[0.9995359,0.00009715227,0.00001551316,0.00008273705,0.0001738252,0.00009492836],"domain_scores_gemma":[0.999328,0.0001346462,0.0001183372,0.00009560894,0.0001349972,0.0001884645],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002120296,0.00001083243,0.00005403136,0.00001457422,0.000004251841,0.00002659751,0.00003970765,0.005292643,0.001080895,0.9897022,0.0009585745,0.002794425],"study_design_scores_gemma":[0.0000123429,0.00004107244,0.0002879715,0.0000124028,0.000005429502,0.00008862515,0.0000829831,0.05126908,0.0006095999,0.9443894,0.003171386,0.00002966663],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3893757,0.00074057,0.4249828,0.001968259,0.0005665392,0.0001460125,0.0008841184,0.0004146282,0.1809214],"genre_scores_gemma":[0.9412975,0.0004406257,0.03108599,0.0003002108,0.0002989115,0.00007867751,0.0003772262,0.0002094209,0.02591136],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01551549,"threshold_uncertainty_score":0.05190456,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"James King","is_ca":true},{"name":"David Kirkpatrick","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04409133552517794,"gpt":0.2635143971703761,"spread":0.2194230616451982,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009282774,0.001465235,0.00266359,0.001327052,0.0007357004,0.002211367,0.002727418,0.001893679,0.01100152],"category_scores_gemma":[0.007009465,0.0008198966,0.001736178,0.001797188,0.001527546,0.004172235,0.005401935,0.002991707,0.002237027],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001170383,"about_ca_system_score_gemma":0.0010075,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002375074,"about_ca_topic_score_gemma":0.002641566,"domain_scores_codex":[0.999014,0.000197086,0.00005072325,0.0001765041,0.0003699806,0.0001916073],"domain_scores_gemma":[0.996682,0.001653901,0.0001976197,0.001050934,0.0001929211,0.0002225915],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001436047,0.0004314761,0.00227731,0.0005950048,0.0001490934,0.000453878,0.0005967849,0.4808384,0.0109875,0.2016835,0.02303805,0.2775131],"study_design_scores_gemma":[0.00007821384,0.000113548,0.0002400395,0.00003817706,0.00002951943,0.0001280727,0.00007611983,0.8636324,0.001912675,0.131014,0.002719147,0.00001807946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2002195,0.0007657268,0.7705725,0.0007084017,0.0002599829,0.0002310001,0.0006974476,0.002891473,0.02365389],"genre_scores_gemma":[0.5953966,0.0006052858,0.388674,0.0002258049,0.0001296776,0.000195027,0.001622259,0.0006551336,0.01249625],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01100152,"threshold_uncertainty_score":0.03680378,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Yoshitake Matsumoto","is_ca":false},{"name":"Sonoko Moriyama","is_ca":false},{"name":"Hiroshi Imai","is_ca":false},{"name":"David Avis","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02858888342012684,"gpt":0.2659561851132227,"spread":0.2373673016930958,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007802255,0.0007521865,0.00125901,0.001829235,0.00111975,0.003540277,0.002288464,0.0009155357,0.01228071],"category_scores_gemma":[0.004736769,0.0007607859,0.001484244,0.002516719,0.001263947,0.004990754,0.003607351,0.004039321,0.002837017],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0012412,"about_ca_system_score_gemma":0.0007497839,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001362885,"about_ca_topic_score_gemma":0.002067254,"domain_scores_codex":[0.99889,0.0002280156,0.00008072787,0.0002045211,0.0004530784,0.000143677],"domain_scores_gemma":[0.9976957,0.0009955071,0.0001395771,0.0006157382,0.0004036958,0.0001497186],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006783483,0.0001036298,0.0005821256,0.0001316763,0.00001930499,0.00006091017,0.0001899955,0.01324542,0.00191645,0.8819565,0.008274723,0.09345144],"study_design_scores_gemma":[0.00001155334,0.00001835418,0.0001729038,0.00002406942,0.00001199649,0.00008256769,0.00005856546,0.06667483,0.001269645,0.9240833,0.007579624,0.00001244442],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02630816,0.0003013122,0.9426997,0.0004866199,0.0001011421,0.00008210664,0.0005938603,0.0007165797,0.02871048],"genre_scores_gemma":[0.3890965,0.001055246,0.568699,0.0005000352,0.0003275874,0.0003719882,0.003505788,0.00105523,0.03538866],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01228071,"threshold_uncertainty_score":0.04108304,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.01923316589679318,"gpt":0.2617628820439277,"spread":0.2425297161471345,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001072876,0.0006408017,0.0007612308,0.00117189,0.00142979,0.002105517,0.001105641,0.001416582,0.01141783],"category_scores_gemma":[0.004306461,0.0004649883,0.0004045847,0.0006376223,0.002516097,0.00311366,0.001320898,0.001290036,0.0006191051],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004672808,"about_ca_system_score_gemma":0.0004658669,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005637255,"about_ca_topic_score_gemma":0.0006208754,"domain_scores_codex":[0.9992595,0.0001933411,0.00003698314,0.00009680906,0.0002848681,0.0001285062],"domain_scores_gemma":[0.9982345,0.0007388055,0.0001534163,0.0004294038,0.000266399,0.0001774019],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001361366,0.00003514414,0.000376861,0.00004762282,0.000007186386,0.0002110423,0.0001008528,0.003999746,0.007920196,0.9828075,0.001279106,0.003078607],"study_design_scores_gemma":[0.00004566538,0.0000230549,0.0005680692,0.00001235194,0.000005896549,0.0003446593,0.0001443479,0.04377392,0.006143991,0.9482595,0.0006577505,0.00002073625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8104627,0.0004276574,0.08320221,0.001803627,0.0003120759,0.00005112107,0.0004160014,0.0005480771,0.1027766],"genre_scores_gemma":[0.9876446,0.0001374495,0.008198358,0.0002181731,0.00005640033,0.00002209541,0.0001547111,0.0001240552,0.003444177],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01141783,"threshold_uncertainty_score":0.03819644,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Richard Kenyon","is_ca":false},{"name":"Boris Solomyak","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02202294936104782,"gpt":0.2929062644779385,"spread":0.2708833151168907,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007144058,0.0006504138,0.0007176922,0.002830139,0.0009792752,0.002722976,0.0007692556,0.001064994,0.005499141],"category_scores_gemma":[0.004408939,0.0003872215,0.0005398425,0.001110541,0.00273463,0.003978104,0.001972584,0.001659935,0.000606523],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007098551,"about_ca_system_score_gemma":0.0002858865,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004954498,"about_ca_topic_score_gemma":0.0003938892,"domain_scores_codex":[0.9996061,0.00007357365,0.00002687259,0.00009889848,0.0001016591,0.00009286179],"domain_scores_gemma":[0.9972305,0.001381619,0.0004119427,0.0002316033,0.0003718867,0.000372591],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009070701,0.00004509609,0.0009249884,0.00006367051,0.000008940558,0.0001997821,0.0005246561,0.005339062,0.006170575,0.9700071,0.001025555,0.01559988],"study_design_scores_gemma":[0.00002391911,0.0001150432,0.001595364,0.00005375274,0.00001687006,0.0005544024,0.0003945752,0.07271624,0.004895116,0.9134152,0.006175868,0.00004355148],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7487937,0.001073824,0.1932328,0.0006207456,0.0001591941,0.00008311692,0.0002697931,0.0002916036,0.05547536],"genre_scores_gemma":[0.9724835,0.0005282615,0.01483928,0.0001338643,0.0001994919,0.00004764712,0.0003462949,0.0001281176,0.01129349],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005499141,"threshold_uncertainty_score":0.0183965,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Gábor Tardos","is_ca":true},{"name":"Gézá Tóth","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02555882728740597,"gpt":0.2870210564526353,"spread":0.2614622291652293,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002850694,0.0005916139,0.0007219603,0.001342128,0.0007700745,0.001739136,0.0009138345,0.0008960356,0.00858398],"category_scores_gemma":[0.002638993,0.0005545262,0.0007337533,0.0009482328,0.000999936,0.001917759,0.002524458,0.001463112,0.000970587],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000488706,"about_ca_system_score_gemma":0.00018248,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000857805,"about_ca_topic_score_gemma":0.0006075201,"domain_scores_codex":[0.9992695,0.0001221656,0.00003604488,0.0001560132,0.000299972,0.0001162583],"domain_scores_gemma":[0.9988925,0.0004126292,0.0001658913,0.0002218588,0.0001432797,0.0001639406],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003482933,0.00005055515,0.00153084,0.0001927638,0.00007830956,0.001349389,0.0008361033,0.03261735,0.01789001,0.8667071,0.004316852,0.0740824],"study_design_scores_gemma":[0.00007870062,0.0002111495,0.002278376,0.00009229509,0.00006878492,0.003887785,0.0008724006,0.2051901,0.01134012,0.7353553,0.04057198,0.00005301179],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4763674,0.001897006,0.4320382,0.0007797524,0.0005713094,0.00007524035,0.0003227396,0.0003761817,0.08757234],"genre_scores_gemma":[0.9291543,0.0008944417,0.05196011,0.00009767344,0.0001616898,0.00004323507,0.0002730488,0.0001412369,0.01727432],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00858398,"threshold_uncertainty_score":0.02871633,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Pankaj K. Agarwal","is_ca":false},{"name":"Rolf Klein","is_ca":false},{"name":"Christian Knauer","is_ca":false},{"name":"Stefan Langerman","is_ca":false},{"name":"Pat Morin","is_ca":true},{"name":"Micha Sharir","is_ca":false},{"name":"Michael Soss","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01198783087499152,"gpt":0.2639476584860729,"spread":0.2519598276110814,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005595618,0.0006774379,0.000797055,0.002038137,0.0004682817,0.001178919,0.001023285,0.0008816889,0.002076579],"category_scores_gemma":[0.005971759,0.0005417665,0.000459059,0.001365862,0.0006316837,0.002069097,0.0008910809,0.000501873,0.0002888283],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006102461,"about_ca_system_score_gemma":0.0004648146,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005867352,"about_ca_topic_score_gemma":0.01087806,"domain_scores_codex":[0.9996642,0.00006789839,0.00002232706,0.00007306601,0.0001253589,0.00004719098],"domain_scores_gemma":[0.9981614,0.00128668,0.0001637082,0.0001133575,0.0001481732,0.0001267093],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00095147,0.0001457079,0.01568652,0.0002297773,0.0001129085,0.0002553884,0.0003485836,0.7828592,0.009414848,0.02165491,0.001892438,0.1664483],"study_design_scores_gemma":[0.00001442212,0.00003204151,0.001203479,0.00000513395,0.000009168873,0.00005643074,0.0000674913,0.9890172,0.001713209,0.007556044,0.0003164794,0.000008861649],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.820177,0.0004495315,0.1748197,0.0001590038,0.00002329092,0.0000370017,0.0004444778,0.000960421,0.002929708],"genre_scores_gemma":[0.8951337,0.0001887698,0.1027153,0.00002024002,0.00001195434,0.00002760367,0.00059139,0.0001766706,0.001134294],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005867352,"threshold_uncertainty_score":0.01166642,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"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","authors":[{"name":"Timothy M. Chan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02273547351149665,"gpt":0.2810125727492365,"spread":0.2582770992377398,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049852,0.0005883676,0.0007601489,0.002097512,0.001586148,0.003037149,0.001177553,0.001348014,0.01439449],"category_scores_gemma":[0.003365725,0.0007378208,0.0007682622,0.001597927,0.002675742,0.003506991,0.003064187,0.002375427,0.00251304],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001012323,"about_ca_system_score_gemma":0.000355933,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00155798,"about_ca_topic_score_gemma":0.001940275,"domain_scores_codex":[0.9993389,0.0001736094,0.00004058664,0.000117147,0.0001936395,0.0001361172],"domain_scores_gemma":[0.9991127,0.000324479,0.0001024336,0.0001515816,0.000145814,0.0001630578],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002781946,0.00001160777,0.0002867422,0.00003665151,0.000005455694,0.00006840941,0.0002940576,0.005553664,0.0007849011,0.9769693,0.00175761,0.01420373],"study_design_scores_gemma":[0.00001029381,0.00002086065,0.0001668883,0.0000294219,0.000005064102,0.00006775029,0.0002172722,0.01464543,0.0003648093,0.974337,0.01012661,0.00000860226],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.223568,0.001612593,0.6254859,0.001544982,0.0007810795,0.0001579496,0.0004482549,0.0007839452,0.1456172],"genre_scores_gemma":[0.772108,0.001380481,0.1669528,0.0003545919,0.0002947072,0.0001341447,0.000558218,0.0005671941,0.05764969],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01439449,"threshold_uncertainty_score":0.04815435,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","authors":[{"name":"J�nos Pach","is_ca":false},{"name":"József Solymosi","is_ca":false},{"name":"G�za T�th","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02263484183521906,"gpt":0.2668587935351035,"spread":0.2442239516998845,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001025272,0.0007606047,0.001134921,0.002834262,0.00286523,0.003049306,0.002166235,0.00192302,0.008094205],"category_scores_gemma":[0.006367953,0.001205939,0.0009306095,0.002034127,0.004019795,0.005718926,0.003901064,0.003809051,0.0006474896],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001185294,"about_ca_system_score_gemma":0.0005331311,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007634308,"about_ca_topic_score_gemma":0.001381657,"domain_scores_codex":[0.9987476,0.0003173562,0.00006882363,0.0002945673,0.0003578794,0.0002137917],"domain_scores_gemma":[0.9956691,0.002224735,0.0006011969,0.0004717845,0.0003055264,0.0007276905],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004356022,0.00002039328,0.0003888932,0.00004817145,0.000008948931,0.0001541536,0.0003291475,0.005637641,0.000491711,0.989511,0.0006917844,0.00267462],"study_design_scores_gemma":[0.00001070506,0.00001614615,0.0002071619,0.00001217514,0.000008329561,0.0001126321,0.000190286,0.00822464,0.0003029016,0.9898098,0.001096853,0.000008278007],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6923692,0.000792812,0.2333119,0.001423084,0.0002481921,0.00008946907,0.0004493505,0.0005543462,0.0707616],"genre_scores_gemma":[0.9645823,0.0003427636,0.02564074,0.0001786972,0.0001314316,0.0001075748,0.0004133428,0.0001659999,0.008437151],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008094205,"threshold_uncertainty_score":0.02707779,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Paweł Dłotko","is_ca":false},{"name":"Tomasz Kaczyński","is_ca":true},{"name":"Marian Mrożek","is_ca":false},{"name":"Thomas Wanner","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01180848908257605,"gpt":0.2706817022188281,"spread":0.2588732131362521,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000652107,0.0003961495,0.0006475516,0.001806236,0.0006132409,0.001700247,0.001735245,0.0005459189,0.01148731],"category_scores_gemma":[0.002162361,0.0003215739,0.0006269538,0.001140124,0.00109369,0.003634303,0.003287685,0.001477576,0.002730968],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000690055,"about_ca_system_score_gemma":0.0007887912,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008860708,"about_ca_topic_score_gemma":0.0008648855,"domain_scores_codex":[0.9992864,0.00008340085,0.00005337929,0.0002020987,0.0002628937,0.0001119536],"domain_scores_gemma":[0.9991263,0.0002367595,0.00004432893,0.0002613496,0.0002607954,0.00007047545],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002194237,0.0001491425,0.001896997,0.0002717703,0.00004491886,0.0003263707,0.0005224886,0.02098822,0.0260081,0.4945177,0.0100811,0.4449739],"study_design_scores_gemma":[0.00008540473,0.0002115461,0.001499747,0.0000760054,0.00004546079,0.000918416,0.0004533128,0.3998351,0.06779111,0.4715423,0.05746048,0.00008103945],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02651431,0.0001373328,0.9655029,0.00009428742,0.000051597,0.00008791724,0.000105853,0.001344351,0.006161393],"genre_scores_gemma":[0.2938677,0.0002855577,0.6933138,0.0001746429,0.0000530602,0.0001934373,0.001544331,0.0007689851,0.00979846],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01148731,"threshold_uncertainty_score":0.03842884,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","authors":[{"name":"Thérèse Biedl","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01378366533397258,"gpt":0.2381558221013342,"spread":0.2243721567673616,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001630853,0.0006130995,0.0003460594,0.0008556707,0.0005395077,0.0009602733,0.000727594,0.0005583482,0.01051371],"category_scores_gemma":[0.001747896,0.0003838139,0.0003170073,0.001246593,0.0006058144,0.001369479,0.000737927,0.001057248,0.0009761964],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003581699,"about_ca_system_score_gemma":0.0002218604,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008673452,"about_ca_topic_score_gemma":0.002272302,"domain_scores_codex":[0.9997893,0.00005142666,0.000007454255,0.00004795741,0.00007879005,0.00002509871],"domain_scores_gemma":[0.9992347,0.0002778734,0.0001060894,0.0001930597,0.0001037754,0.00008449434],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001948341,0.00008482028,0.0009773911,0.0001905425,0.00002803606,0.0005273303,0.0003177988,0.08616562,0.02268641,0.7415338,0.01527974,0.1320138],"study_design_scores_gemma":[0.00009290276,0.000122877,0.001623878,0.00004660773,0.00006133018,0.0007524414,0.0003000311,0.1716084,0.01614235,0.7418166,0.06739894,0.00003360501],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2254721,0.0006931458,0.6678268,0.0006704552,0.0002304567,0.0001738557,0.0007634213,0.00125256,0.1029173],"genre_scores_gemma":[0.7411366,0.001569743,0.2109856,0.0002118857,0.0001361854,0.0001565056,0.001642935,0.0004723652,0.04368829],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01051371,"threshold_uncertainty_score":0.03517193,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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)","authors":[{"name":"Thérèse Biedl","is_ca":true},{"name":"Erik D. Demaine","is_ca":true},{"name":"Martin L. Demaine","is_ca":true},{"name":"Sylvain Lazard","is_ca":false},{"name":"Anna Lubiw","is_ca":true},{"name":"Joseph O’Rourke","is_ca":false},{"name":"M. Overmars","is_ca":false},{"name":"Steven Robbins","is_ca":true},{"name":"Ileana Streinu","is_ca":false},{"name":"Godfried Toussaint","is_ca":true},{"name":"Sue Whitesides","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01483621241296793,"gpt":0.2540274448580924,"spread":0.2391912324451244,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001967204,0.0002055983,0.0003690525,0.0005761168,0.0008001015,0.001608865,0.0007404654,0.0008396555,0.006843833],"category_scores_gemma":[0.001457962,0.0003383462,0.0002338601,0.0004524707,0.00178569,0.001272719,0.001192841,0.0006926698,0.0004426115],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003313507,"about_ca_system_score_gemma":0.0003887122,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001181779,"about_ca_topic_score_gemma":0.001387599,"domain_scores_codex":[0.9998223,0.00002798016,0.00000956343,0.00004022086,0.00005160365,0.00004834174],"domain_scores_gemma":[0.9994267,0.0001668153,0.000095106,0.0001091372,0.00007276955,0.0001294665],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005009556,0.0001744946,0.001864136,0.0001034308,0.00002536934,0.0004494815,0.0005775198,0.2588562,0.01949866,0.6718289,0.001633675,0.0444872],"study_design_scores_gemma":[0.00006242157,0.000129956,0.0008601309,0.00003096316,0.00001408734,0.0001290681,0.0004652796,0.7024837,0.006154766,0.284508,0.005131044,0.00003061889],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7355903,0.00049932,0.2362418,0.0002876359,0.0002198933,0.00005896017,0.0001197185,0.0002537669,0.02672866],"genre_scores_gemma":[0.9762129,0.0001573325,0.01472009,0.00003748326,0.00002015255,0.00003027978,0.00006250997,0.00007790991,0.008681308],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006843833,"threshold_uncertainty_score":0.02289492,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Lyudmil Aleksandrov","is_ca":false},{"name":"Hristo Djidjev","is_ca":false},{"name":"Hua Guo","is_ca":true},{"name":"Anil Maheshwari","is_ca":true},{"name":"Doron Nussbaum","is_ca":true},{"name":"Jörg-Rüdiger Sack","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01929003721726897,"gpt":0.2807975083370942,"spread":0.2615074711198252,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00199828,0.001792954,0.00344438,0.002384674,0.001600682,0.004326002,0.005469124,0.002596575,0.009905683],"category_scores_gemma":[0.01429492,0.001325761,0.001733094,0.006716004,0.001535075,0.01048468,0.006655388,0.002897348,0.002080685],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002566333,"about_ca_system_score_gemma":0.002079603,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00740019,"about_ca_topic_score_gemma":0.009669504,"domain_scores_codex":[0.9960044,0.0005421607,0.0003093841,0.0008041966,0.001848842,0.0004910656],"domain_scores_gemma":[0.9927349,0.004072795,0.0003502674,0.001787909,0.0007964423,0.0002575965],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001402192,0.0004135954,0.002035471,0.0008027637,0.0001958365,0.0001950951,0.0006768399,0.4710714,0.008081797,0.09406059,0.02237766,0.3986867],"study_design_scores_gemma":[0.0000951379,0.00005443304,0.0001465032,0.0000180736,0.0000254995,0.00006090928,0.0001772288,0.9195784,0.001814001,0.07576524,0.002248283,0.00001636872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04740949,0.0007892401,0.9415538,0.0006389632,0.0001211921,0.0003180229,0.00101797,0.004052598,0.004098753],"genre_scores_gemma":[0.3187869,0.000633685,0.6693311,0.0002118857,0.0001112023,0.0005592968,0.004171025,0.0009994534,0.005195422],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009905683,"threshold_uncertainty_score":0.03313786,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Timothy M. Chan","is_ca":true},{"name":"Konstantinos Tsakalidis","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.019191564393856,"gpt":0.279467088473464,"spread":0.260275524079608,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001103947,0.001114169,0.001453144,0.001204837,0.001070023,0.001676277,0.0024372,0.00200649,0.01193673],"category_scores_gemma":[0.005793489,0.001489782,0.001672681,0.00133072,0.001252875,0.001965795,0.003210292,0.001811369,0.001197135],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002536333,"about_ca_system_score_gemma":0.002682673,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009643093,"about_ca_topic_score_gemma":0.01996345,"domain_scores_codex":[0.9990932,0.0001447533,0.0000662338,0.0002049882,0.0003240147,0.000166928],"domain_scores_gemma":[0.9968632,0.002084757,0.000205315,0.0003959422,0.0003191514,0.0001315857],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002682707,0.00008804201,0.0007143155,0.0002182078,0.00004019602,0.00003414975,0.0001280844,0.7881289,0.002560653,0.05142985,0.004215189,0.1521741],"study_design_scores_gemma":[0.00003011752,0.0000249174,0.0001177023,0.00001184732,0.000008290364,0.00001263715,0.00002106381,0.9801552,0.0005530647,0.01815255,0.0009043261,0.000008367459],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01465724,0.0002642206,0.9796163,0.0001809387,0.00005948833,0.00007823867,0.0001320246,0.0007141742,0.004297267],"genre_scores_gemma":[0.2164354,0.0002601122,0.7771612,0.0001360048,0.00004755622,0.0002769665,0.000407412,0.0004226909,0.00485256],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01193673,"threshold_uncertainty_score":0.03993231,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Andreas F. Holmsen","is_ca":false},{"name":"Meir Katchalski","is_ca":false},{"name":"Ted G. Lewis","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01665846638318672,"gpt":0.2497254001443914,"spread":0.2330669337612047,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001751092,0.001030176,0.001347892,0.003222371,0.003166549,0.004181136,0.002114407,0.001983749,0.01256456],"category_scores_gemma":[0.007782252,0.001181541,0.002058909,0.002705514,0.004838276,0.01402127,0.006466598,0.007360158,0.001233752],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001876772,"about_ca_system_score_gemma":0.0006676074,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001400248,"about_ca_topic_score_gemma":0.0009678823,"domain_scores_codex":[0.9988514,0.0002889753,0.00006611416,0.0003210242,0.0002582879,0.0002142087],"domain_scores_gemma":[0.9946302,0.003027784,0.0005175733,0.0005031431,0.0006666628,0.0006545791],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004121731,0.00001309121,0.0001702083,0.00004260887,0.00001180725,0.00003818146,0.0002612944,0.0006080326,0.0004097411,0.9938667,0.001549184,0.002987939],"study_design_scores_gemma":[0.00002310132,0.00002215484,0.0001859985,0.00001411035,0.00001711752,0.00007851143,0.0001399802,0.002894934,0.0003522604,0.9927901,0.003467695,0.00001405336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2000138,0.001509859,0.6952441,0.006011757,0.0007747709,0.0001342519,0.0008410179,0.0005061876,0.09496424],"genre_scores_gemma":[0.8365103,0.002703585,0.09172624,0.002351612,0.001305483,0.0004084785,0.001094178,0.0004909841,0.0634091],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01256456,"threshold_uncertainty_score":0.04203266,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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)","authors":[{"name":"Hazel Everett","is_ca":false},{"name":"Sylvain Lazard","is_ca":false},{"name":"Giuseppe Liotta","is_ca":false},{"name":"Stephen Wismath","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01397936658932336,"gpt":0.2536207482553113,"spread":0.239641381665988,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007430688,0.0007539913,0.001173001,0.002112802,0.001988222,0.00317423,0.002390781,0.001833035,0.008795505],"category_scores_gemma":[0.005295218,0.00121175,0.00130127,0.001768417,0.002372839,0.003351161,0.004202615,0.001912725,0.001181913],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001747867,"about_ca_system_score_gemma":0.0005592236,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001642814,"about_ca_topic_score_gemma":0.00188458,"domain_scores_codex":[0.9985629,0.0001991783,0.0001344256,0.0003715687,0.0004418592,0.0002901288],"domain_scores_gemma":[0.997449,0.001124012,0.0003849961,0.0004418213,0.0002773853,0.0003227588],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00026617,0.00008472609,0.001407332,0.0001617389,0.00002749012,0.0002729239,0.0009466263,0.01824513,0.003534915,0.9266908,0.003455033,0.04490711],"study_design_scores_gemma":[0.00006965514,0.00007346496,0.001505205,0.0001390909,0.00004539571,0.0003349895,0.0006055025,0.04977284,0.005475841,0.9319155,0.01000621,0.00005641032],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.46488,0.0005897942,0.4471799,0.0005417792,0.000148742,0.000210658,0.001740951,0.0008467279,0.0838614],"genre_scores_gemma":[0.8835155,0.0005004483,0.09822534,0.000183735,0.00004793362,0.0003081766,0.001900733,0.0003870259,0.01493101],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008795505,"threshold_uncertainty_score":0.02942389,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Antoine Deza","is_ca":true},{"name":"Sui Huang","is_ca":true},{"name":"Tamon Stephen","is_ca":true},{"name":"Tamás Terlaky","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.004734151466921731,"gpt":0.2035880382521763,"spread":0.1988538867852546,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005471673,0.0008422109,0.001032734,0.002248988,0.002252111,0.00435485,0.001283293,0.00141141,0.02466405],"category_scores_gemma":[0.002189725,0.0006688097,0.0009437541,0.001564243,0.003243891,0.006817191,0.004640584,0.004790543,0.00292034],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001874493,"about_ca_system_score_gemma":0.0006179349,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001811006,"about_ca_topic_score_gemma":0.002280106,"domain_scores_codex":[0.9991887,0.0001140652,0.00003098715,0.000191219,0.0002922418,0.0001828243],"domain_scores_gemma":[0.9988071,0.0004107397,0.00007496001,0.0002428245,0.0002331901,0.0002312018],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000006469775,0.000005071245,0.00002838717,0.0000107553,0.000001869361,0.00001375201,0.00007840132,0.0002636717,0.0002862746,0.9963492,0.0007727037,0.002183356],"study_design_scores_gemma":[0.000002972155,0.000003241262,0.00004134316,0.000005409231,0.000003253815,0.00004059079,0.00004095681,0.001101623,0.0002861517,0.9930544,0.005414697,0.000005428501],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1674182,0.00126234,0.3508585,0.003732407,0.0006603734,0.0001293369,0.001289241,0.0009163691,0.4737332],"genre_scores_gemma":[0.8144116,0.0008522957,0.05024106,0.0009407711,0.0003359217,0.00007790112,0.0007066946,0.0005438149,0.1318899],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02466405,"threshold_uncertainty_score":0.08250946,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Prosenjit Bose","is_ca":true},{"name":"Michael E. Houle","is_ca":false},{"name":"Godfried T. Toussaint","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02535542343954046,"gpt":0.2833968965844862,"spread":0.2580414731449457,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002688202,0.0005674606,0.00112326,0.002152488,0.001613286,0.002899135,0.0015672,0.001685223,0.009095741],"category_scores_gemma":[0.002293439,0.001036996,0.0007336896,0.002986033,0.001246745,0.004220589,0.002286961,0.002036218,0.00247661],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005793295,"about_ca_system_score_gemma":0.0003142782,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005872899,"about_ca_topic_score_gemma":0.0006071812,"domain_scores_codex":[0.9992361,0.00007001617,0.00005688395,0.0002163912,0.00028425,0.0001363668],"domain_scores_gemma":[0.9982084,0.0007438895,0.0002757014,0.0002680899,0.0003130703,0.0001907893],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004317618,0.0003305373,0.004270244,0.0006099736,0.0000964897,0.0008095639,0.001226505,0.01620902,0.02507126,0.795115,0.01150676,0.1443228],"study_design_scores_gemma":[0.00009855653,0.0001740598,0.00362828,0.0001423259,0.00007288335,0.002084572,0.0007979206,0.07583192,0.0104357,0.8703303,0.03634975,0.00005371848],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3367584,0.0005586912,0.6151515,0.001092997,0.0001225115,0.0002028748,0.00218115,0.000833847,0.04309797],"genre_scores_gemma":[0.6616988,0.0007279977,0.3084255,0.0003256734,0.0001191792,0.0002996867,0.004840888,0.0003134872,0.02324882],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009095741,"threshold_uncertainty_score":0.03042823,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Jeong-Yup Lee","is_ca":true},{"name":"Boris Solomyak","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02142055357960614,"gpt":0.2481817311012595,"spread":0.2267611775216534,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003971272,0.000607686,0.0007056312,0.001189949,0.001129533,0.002227102,0.0006414693,0.0006168699,0.005957349],"category_scores_gemma":[0.00113104,0.0002763449,0.0004901254,0.0008414961,0.001679785,0.001987369,0.001281845,0.0009963765,0.0009106802],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005879418,"about_ca_system_score_gemma":0.0003087596,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004249201,"about_ca_topic_score_gemma":0.0005256237,"domain_scores_codex":[0.9996339,0.00005344095,0.00002145449,0.00006079239,0.0001580834,0.00007228051],"domain_scores_gemma":[0.9994587,0.0001720395,0.00007386974,0.0001561723,0.00008797197,0.0000512487],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005879162,0.000008115136,0.0001347762,0.00002579728,0.000007139773,0.00004370334,0.00008553779,0.0006999067,0.003214496,0.9891542,0.0004813486,0.006086195],"study_design_scores_gemma":[0.00003324598,0.00005624244,0.0004501193,0.00001857079,0.00001594078,0.0003489747,0.0001527132,0.0101598,0.01304604,0.9673848,0.008299009,0.00003456923],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6797149,0.001241976,0.1827938,0.0007306081,0.0002169109,0.0000507996,0.0005694947,0.0004495102,0.134232],"genre_scores_gemma":[0.964965,0.0003423028,0.01801727,0.0001771794,0.00004848337,0.0000384686,0.0002594995,0.0001052483,0.01604661],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005957349,"threshold_uncertainty_score":0.01992929,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Hervé Brönnimann","is_ca":false},{"name":"Hazel Everett","is_ca":false},{"name":"Sylvain Lazard","is_ca":false},{"name":"Frank Sottile","is_ca":false},{"name":"Sue Whitesides","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01529188774370644,"gpt":0.2709324333067807,"spread":0.2556405455630743,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003584358,0.0006113313,0.0003652662,0.001904936,0.0006803886,0.00169401,0.0009140788,0.0006979253,0.008962689],"category_scores_gemma":[0.002755626,0.0004071832,0.0003731115,0.001528723,0.0009961326,0.001270275,0.001747678,0.001412704,0.002166802],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005049452,"about_ca_system_score_gemma":0.0003815705,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001551831,"about_ca_topic_score_gemma":0.001881532,"domain_scores_codex":[0.9995973,0.0000939874,0.00002340725,0.00009189138,0.0001430349,0.00005053802],"domain_scores_gemma":[0.9988324,0.0002307352,0.0002246207,0.0001448357,0.0004204727,0.0001469795],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006435933,0.0002876486,0.004856561,0.000358852,0.00004531447,0.0006781621,0.002482796,0.06685007,0.050781,0.5784022,0.00848169,0.2861322],"study_design_scores_gemma":[0.000104656,0.0006618904,0.004050965,0.0002217453,0.00004392468,0.001066119,0.003171909,0.5006627,0.04499318,0.3607082,0.08422526,0.00008945173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1824214,0.0003056561,0.7982593,0.0001751097,0.0001890589,0.0001887798,0.0004132124,0.001001968,0.01704553],"genre_scores_gemma":[0.6714869,0.0007938623,0.2964179,0.00008253838,0.0000857043,0.000245121,0.001239137,0.0006301556,0.02901863],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008962689,"threshold_uncertainty_score":0.02998316,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Sándor P. Fekete","is_ca":false},{"name":"Henk Meijer","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0116355487962758,"gpt":0.2278982982785908,"spread":0.216262749482315,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002679654,0.001130535,0.002709387,0.002966715,0.002147489,0.00307226,0.002846271,0.002417766,0.01641459],"category_scores_gemma":[0.01869398,0.001294681,0.001676194,0.005074581,0.004139218,0.01006138,0.005906551,0.004399254,0.002008955],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001678437,"about_ca_system_score_gemma":0.0008075032,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001949698,"about_ca_topic_score_gemma":0.001590029,"domain_scores_codex":[0.9982592,0.0006349952,0.00008908962,0.0003897907,0.0003940247,0.0002328591],"domain_scores_gemma":[0.9923258,0.004801322,0.0007236669,0.0007488231,0.0006908367,0.0007095684],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008318642,0.00002543516,0.0002984918,0.00007743954,0.00001429698,0.00002581841,0.0001554432,0.01273053,0.0002636385,0.9666578,0.004179031,0.01548889],"study_design_scores_gemma":[0.000009209271,0.00001065505,0.00009480193,0.00001592359,0.0000044331,0.00002310428,0.00004128469,0.01652522,0.00008666325,0.9807366,0.002446857,0.000005169318],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1073612,0.00349258,0.7842306,0.004727046,0.000591146,0.00009305333,0.0008497748,0.000446377,0.09820825],"genre_scores_gemma":[0.7287607,0.005400783,0.2084493,0.00156418,0.001357623,0.0001796017,0.001749832,0.0007551156,0.05178294],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01641459,"threshold_uncertainty_score":0.05491227,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Meera Sitharam","is_ca":false},{"name":"Heping Gao","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.004790835647840105,"gpt":0.1970904524635009,"spread":0.1922996168156608,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008265305,0.001229344,0.0008787388,0.003042061,0.001458583,0.004405999,0.002355649,0.00206829,0.006859167],"category_scores_gemma":[0.007315659,0.001163956,0.0007125237,0.002908321,0.003249657,0.005805608,0.002420428,0.002187457,0.0007433978],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001409739,"about_ca_system_score_gemma":0.0006580468,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002093815,"about_ca_topic_score_gemma":0.002553933,"domain_scores_codex":[0.9990485,0.0002997775,0.00003490669,0.0002535902,0.00024273,0.0001205004],"domain_scores_gemma":[0.9940594,0.003062866,0.001117219,0.0004998603,0.0006695824,0.0005910716],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003701361,0.00002646657,0.0007749462,0.00004258742,0.00001655188,0.0001151,0.0002164561,0.01656052,0.001134326,0.9751865,0.001211456,0.004678065],"study_design_scores_gemma":[0.00001042326,0.00001609361,0.0004443006,0.00001099481,0.000008662484,0.000112521,0.0001703732,0.04648622,0.0005156744,0.9512514,0.0009562657,0.00001702977],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5392343,0.0005654196,0.4181715,0.001149461,0.00008590402,0.0001085553,0.0007805387,0.000451336,0.03945297],"genre_scores_gemma":[0.9597796,0.0003351771,0.02993882,0.0002418202,0.0001027167,0.00009001988,0.0007692784,0.0001392415,0.008603338],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006859167,"threshold_uncertainty_score":0.02294618,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Rafał Latała","is_ca":false},{"name":"Piotr Mankiewicz","is_ca":false},{"name":"Krzysztof Oleszkiewicz","is_ca":false},{"name":"Nicole Tomczak-Jaegermann","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03444786534423174,"gpt":0.3396752352728123,"spread":0.3052273699285806,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00818923,0.001956094,0.003061224,0.004281824,0.001867591,0.006012546,0.003288549,0.002571177,0.00785941],"category_scores_gemma":[0.03031204,0.001399972,0.002048251,0.003648897,0.007859614,0.01106049,0.006940459,0.006639371,0.0007541465],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003671635,"about_ca_system_score_gemma":0.001880659,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001875893,"about_ca_topic_score_gemma":0.001426373,"domain_scores_codex":[0.9945484,0.002644394,0.000229087,0.0006653939,0.001411964,0.0005008307],"domain_scores_gemma":[0.9696906,0.0210766,0.003086111,0.001441214,0.002348542,0.00235696],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004270916,0.00001547195,0.0001836708,0.0000256608,0.00001429887,0.00002316538,0.00006793967,0.008064855,0.0001335644,0.9890862,0.0003970187,0.001945632],"study_design_scores_gemma":[0.0000205808,0.00003918316,0.0002967647,0.00002323625,0.00001168214,0.00006823253,0.00008156402,0.07720967,0.000197514,0.9210774,0.0009449372,0.00002934625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1858263,0.002594354,0.7884881,0.003726387,0.0002489866,0.0001088212,0.0007050328,0.0001622586,0.01813976],"genre_scores_gemma":[0.8823138,0.004012563,0.08702977,0.0008744386,0.0007848115,0.0004503459,0.0008382407,0.0001864571,0.02350941],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00818923,"threshold_uncertainty_score":0.04330933,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Hee-Kap Ahn","is_ca":false},{"name":"Luis Barba","is_ca":true},{"name":"Prosenjit Bose","is_ca":true},{"name":"Jean-Lou De Carufel","is_ca":true},{"name":"Matias Korman","is_ca":false},{"name":"Eunjin Oh","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01326279494017085,"gpt":0.2650907485037944,"spread":0.2518279535636236,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004798085,0.001222883,0.001252637,0.001369186,0.001139639,0.001421298,0.002285911,0.001143738,0.01976264],"category_scores_gemma":[0.002269447,0.0006809468,0.0009340059,0.001282516,0.0007879535,0.001496343,0.002933722,0.001469921,0.004408497],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001328317,"about_ca_system_score_gemma":0.001871544,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008683404,"about_ca_topic_score_gemma":0.01068867,"domain_scores_codex":[0.9995725,0.00003924159,0.00002107047,0.0001147885,0.0001896967,0.0000627366],"domain_scores_gemma":[0.9993361,0.0002317349,0.00004607872,0.0001233881,0.0001876373,0.0000750969],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005247935,0.0001670059,0.001190531,0.0003490734,0.0000801362,0.0002830371,0.0003516615,0.1348144,0.02048501,0.04596155,0.01900012,0.7767927],"study_design_scores_gemma":[0.0001873029,0.0001095526,0.0002339434,0.00002254835,0.00002809612,0.000130302,0.0001328036,0.9569904,0.009056273,0.02268463,0.01039511,0.00002914577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009738539,0.0001042864,0.981384,0.0001109118,0.00008570858,0.0001814878,0.0001105566,0.003899091,0.004385514],"genre_scores_gemma":[0.1046683,0.00009969652,0.8893126,0.00004657697,0.00003832966,0.0001656278,0.0005089847,0.0008642183,0.004295628],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01976264,"threshold_uncertainty_score":0.06611258,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Pierre Aboulker","is_ca":false},{"name":"Guangda Huzhang","is_ca":false},{"name":"Rohan Kapadia","is_ca":true},{"name":"Cathryn Supko","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01275249910397777,"gpt":0.2532269715375086,"spread":0.2404744724335308,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001116786,0.000617524,0.0005946349,0.00319206,0.001438138,0.004017913,0.0008962473,0.001373956,0.007253385],"category_scores_gemma":[0.00543065,0.0004637855,0.0005300114,0.002570867,0.005359932,0.01041489,0.001969746,0.002840234,0.0008514046],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009524708,"about_ca_system_score_gemma":0.000429863,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001611272,"about_ca_topic_score_gemma":0.001172485,"domain_scores_codex":[0.999043,0.0003690927,0.00005716834,0.000252615,0.0002074031,0.00007072596],"domain_scores_gemma":[0.9976923,0.00106005,0.0003090784,0.0002961349,0.0004175785,0.0002247892],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000007505013,0.000003994494,0.0001264423,0.0000242905,0.000004416491,0.00001816079,0.0001404872,0.0006750527,0.0002206866,0.9911898,0.0007969945,0.00679201],"study_design_scores_gemma":[0.000003117936,0.000009929401,0.0001107868,0.0000114513,0.000003460904,0.00005819499,0.0001034206,0.002165606,0.0001435395,0.988044,0.009340628,0.000005977927],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.091991,0.01669337,0.7945149,0.004928237,0.0008595837,0.00007001538,0.0004950459,0.0003385873,0.09010928],"genre_scores_gemma":[0.8109789,0.007281751,0.134564,0.0006844895,0.001035427,0.0001444785,0.0007737532,0.0003797624,0.04415733],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007253385,"threshold_uncertainty_score":0.02426499,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Joel Hass","is_ca":false},{"name":"Jack Snoeyink","is_ca":false},{"name":"William P. Thurston","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02229325452597693,"gpt":0.2664097479403711,"spread":0.2441164934143942,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009466985,0.0004596751,0.0007901291,0.001520518,0.0007565875,0.001984093,0.001360518,0.001255253,0.004435464],"category_scores_gemma":[0.02040207,0.0006081272,0.0002926354,0.001052963,0.001292298,0.003937548,0.001794614,0.0008139675,0.0003733747],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005423224,"about_ca_system_score_gemma":0.0003305845,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004907734,"about_ca_topic_score_gemma":0.000316804,"domain_scores_codex":[0.9992404,0.0001829916,0.000054121,0.0001267224,0.0002945713,0.0001012587],"domain_scores_gemma":[0.9880531,0.008345018,0.0008316943,0.0008600434,0.0008584594,0.00105179],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00115605,0.0001696052,0.008157542,0.0005642998,0.00007983203,0.0006045811,0.001394856,0.1267862,0.04345642,0.684347,0.0114189,0.1218647],"study_design_scores_gemma":[0.00009416902,0.0002345865,0.006661453,0.0001172538,0.00007126814,0.001142561,0.0009209486,0.4428225,0.01773555,0.5220011,0.008136082,0.00006249458],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8619854,0.002217918,0.1107373,0.001250936,0.0001450535,0.00006177498,0.0007859082,0.0004858635,0.02232987],"genre_scores_gemma":[0.9762183,0.0009720446,0.01972358,0.0000739883,0.0001114266,0.00005654823,0.0003888781,0.0001897574,0.002265441],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004435464,"threshold_uncertainty_score":0.01483804,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Stefan Langerman","is_ca":true},{"name":"William Steiger","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03545249225287653,"gpt":0.2746656796004278,"spread":0.2392131873475513,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001106112,0.0005339307,0.001272121,0.001095679,0.0009047666,0.003797912,0.002109402,0.001661306,0.01557263],"category_scores_gemma":[0.0139811,0.0008022204,0.0007523843,0.001724517,0.00192907,0.009931034,0.002801741,0.002365923,0.001083152],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00147441,"about_ca_system_score_gemma":0.0009219259,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004144903,"about_ca_topic_score_gemma":0.003855014,"domain_scores_codex":[0.9985904,0.000304895,0.0000773714,0.0002403372,0.0005007333,0.0002862566],"domain_scores_gemma":[0.990464,0.007176042,0.0006893959,0.0007682333,0.0004737132,0.0004286069],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007437623,0.0001332103,0.005366013,0.0004129712,0.00006409055,0.0002171036,0.0006286795,0.326136,0.004681963,0.538603,0.01435458,0.1086586],"study_design_scores_gemma":[0.00005608997,0.00005084773,0.001143216,0.00003002458,0.00002327322,0.0001295452,0.0001929902,0.560128,0.001405056,0.4340869,0.002726814,0.00002723391],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5471389,0.002219524,0.3879757,0.004194591,0.0002176249,0.0001267906,0.002285415,0.001045826,0.0547955],"genre_scores_gemma":[0.9192745,0.001202062,0.06840726,0.0002222045,0.0001768318,0.00007199602,0.0009745071,0.0003966479,0.009273966],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01557263,"threshold_uncertainty_score":0.05209565,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Avner Magen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01767067653383163,"gpt":0.2824645015259168,"spread":0.2647938249920851,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004845464,0.0004876426,0.0007234597,0.0007598588,0.0005561535,0.001516984,0.0008137317,0.0006680029,0.003087498],"category_scores_gemma":[0.002667099,0.0003526712,0.0007654856,0.0006510215,0.00109329,0.001834242,0.001490105,0.001810231,0.0008641268],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004938384,"about_ca_system_score_gemma":0.0004328249,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000675052,"about_ca_topic_score_gemma":0.0009218894,"domain_scores_codex":[0.999428,0.00009625639,0.00003873105,0.0001070375,0.0002679734,0.0000619907],"domain_scores_gemma":[0.9989676,0.0002608149,0.0001310576,0.0004278019,0.0001454779,0.00006709564],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002746756,0.0002086568,0.0008732199,0.0001789119,0.00006208823,0.00015965,0.0005009407,0.1128788,0.03779883,0.6232174,0.0103567,0.21349],"study_design_scores_gemma":[0.00004873737,0.0002181106,0.001081391,0.00002402446,0.00004351417,0.0004568623,0.0002617603,0.4500755,0.03378601,0.4918582,0.02208822,0.00005760514],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1304181,0.000421813,0.8512766,0.0006937842,0.000429814,0.0000777104,0.0002610994,0.0006483056,0.01577281],"genre_scores_gemma":[0.6732343,0.0006574198,0.3011199,0.0003433388,0.0004012598,0.0001303312,0.0005121351,0.0008148966,0.02278646],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003087498,"threshold_uncertainty_score":0.01032871,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Antoine Deza","is_ca":true},{"name":"Tamás Terlaky","is_ca":true},{"name":"Yuriy Zinchenko","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03949021774810775,"gpt":0.3228103529865319,"spread":0.2833201352384241,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001313903,0.000990555,0.001499499,0.00158975,0.002719997,0.005198827,0.002776425,0.002894439,0.02219298],"category_scores_gemma":[0.007895005,0.0009973244,0.00184718,0.001854142,0.005541668,0.01083714,0.006221277,0.0104741,0.002608642],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001520902,"about_ca_system_score_gemma":0.0008043955,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001461134,"about_ca_topic_score_gemma":0.001164229,"domain_scores_codex":[0.9987109,0.000196309,0.00006109148,0.0004465682,0.0003234003,0.0002617984],"domain_scores_gemma":[0.9931554,0.00414363,0.0003210423,0.001006926,0.0005283672,0.0008445797],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001081686,0.00006594274,0.0007789322,0.000121384,0.00001393565,0.0001163341,0.0002082497,0.00156148,0.000557773,0.9835643,0.00742964,0.005474004],"study_design_scores_gemma":[0.00004771773,0.00002814071,0.000438666,0.00002855664,0.00001136467,0.000113229,0.0001455781,0.005957142,0.0004280072,0.9880738,0.004710995,0.00001681606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4457744,0.00207859,0.2169438,0.02678588,0.001954033,0.0001323691,0.002631339,0.0009521085,0.3027475],"genre_scores_gemma":[0.9288663,0.001135097,0.02654844,0.003419365,0.0008845152,0.000145899,0.002368512,0.0002755125,0.03635638],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02219298,"threshold_uncertainty_score":0.07424295,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Nantel Bergeron","is_ca":true},{"name":"Cesar Ceballos","is_ca":true},{"name":"Jean‐Philippe Labbé","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09453200583366962,"gpt":0.3719656877612763,"spread":0.2774336819276067,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001359325,0.0004023832,0.0003247233,0.0009081534,0.001101613,0.001769332,0.0003917655,0.0004274489,0.009839133],"category_scores_gemma":[0.0004788568,0.0002891804,0.0004844924,0.000384835,0.001000908,0.001107053,0.001162026,0.0006900125,0.001033738],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006016845,"about_ca_system_score_gemma":0.0002693602,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001284101,"about_ca_topic_score_gemma":0.002151136,"domain_scores_codex":[0.9997812,0.0000294423,0.00001321113,0.00005207627,0.00006903691,0.00005506885],"domain_scores_gemma":[0.9997793,0.0000448386,0.00003292472,0.0000266278,0.00004193598,0.00007442315],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008420516,0.00002897367,0.002025796,0.00006513645,0.00001459719,0.0006824601,0.0005154283,0.004376237,0.01107328,0.9669605,0.002423134,0.01175019],"study_design_scores_gemma":[0.00004543977,0.0001365833,0.008396969,0.00008637521,0.00004548334,0.002241703,0.002082016,0.06698769,0.01836623,0.8121317,0.08935694,0.0001228067],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.796986,0.0004004408,0.08243779,0.0003613971,0.0001515343,0.00006357829,0.0004661655,0.0002934024,0.1188396],"genre_scores_gemma":[0.9573465,0.0001517904,0.02206255,0.00006499418,0.00003562026,0.00005615917,0.0006029049,0.00009441251,0.01958509],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009839133,"threshold_uncertainty_score":0.03291523,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Luca Castelli Aleardi","is_ca":false},{"name":"Éric Fusy","is_ca":true},{"name":"Thomas Lewiner","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02141033322352696,"gpt":0.2912366988568698,"spread":0.2698263656333428,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000553373,0.0005565663,0.0006459065,0.001971143,0.001062689,0.002335692,0.001266139,0.001133021,0.01059838],"category_scores_gemma":[0.003514476,0.0004595122,0.0006343522,0.00215329,0.001398548,0.002765767,0.002618914,0.001685879,0.001345491],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008639054,"about_ca_system_score_gemma":0.000470622,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001561453,"about_ca_topic_score_gemma":0.002754674,"domain_scores_codex":[0.9996295,0.00008497963,0.00002312436,0.00007461587,0.0001273631,0.00006042774],"domain_scores_gemma":[0.9991904,0.0003346557,0.00008306716,0.0001952787,0.0001243027,0.00007226153],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004694732,0.00002352701,0.0002089821,0.00005105073,0.000005032288,0.00009001117,0.0002078283,0.01285527,0.00201628,0.9145604,0.002432362,0.06750228],"study_design_scores_gemma":[0.00001249322,0.00003526163,0.0002210912,0.00004774885,0.00001348025,0.0002288282,0.000269395,0.1606824,0.003818552,0.8216249,0.01301624,0.00002968653],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07154549,0.0008953208,0.892132,0.0005181428,0.000261702,0.00007335873,0.000195153,0.0008087566,0.03357],"genre_scores_gemma":[0.5246989,0.001962896,0.4221918,0.0003351499,0.0002305332,0.0001255003,0.0004797303,0.001006505,0.04896894],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01059838,"threshold_uncertainty_score":0.03545517,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"Hungarian Scientific Research Fund; National Science Foundation","keywords":"Conjecture; Mathematics; Polytope; Combinatorics","authors":[{"name":"Károly Bezdek","is_ca":true},{"name":"Robert Connelly","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0318057519365094,"gpt":0.340423083786781,"spread":0.3086173318502716,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001144541,0.001057565,0.001845313,0.001841726,0.003611977,0.005297956,0.001467271,0.003373498,0.01983927],"category_scores_gemma":[0.007641631,0.0007962958,0.001470874,0.0015249,0.005027588,0.009652697,0.004340896,0.00613742,0.003583184],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001564202,"about_ca_system_score_gemma":0.0007275725,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003004361,"about_ca_topic_score_gemma":0.002601026,"domain_scores_codex":[0.9987779,0.0002306253,0.00006264891,0.000317711,0.0003243047,0.0002867437],"domain_scores_gemma":[0.9973512,0.001217099,0.0002823819,0.0004977005,0.0003001371,0.0003515497],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000918891,0.00002245543,0.0003560251,0.0001057858,0.00001575827,0.0001064981,0.0002068253,0.002385644,0.0003288219,0.9816544,0.01008035,0.004645471],"study_design_scores_gemma":[0.00001618085,0.000007665062,0.0001996333,0.00002332891,0.0000064149,0.00007513756,0.000138273,0.003249096,0.0001476508,0.9914492,0.004672705,0.00001466507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.3166989,0.003372981,0.08452543,0.03100655,0.002781339,0.00006199023,0.001460646,0.0009588659,0.5591334],"genre_scores_gemma":[0.9326152,0.001878045,0.01176026,0.002697152,0.001461818,0.00007092363,0.001234654,0.0002956908,0.04798624],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01983927,"threshold_uncertainty_score":0.06636894,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"National Science Foundation","keywords":"Combinatorics; Mathematics; Conjecture; Upper and lower bounds; Path (computing); Mathematical analysis","authors":[{"name":"Sergey Bereg","is_ca":false},{"name":"Prosenjit Bose","is_ca":true},{"name":"Adrian Dumitrescu","is_ca":false},{"name":"Ferrán Hurtado","is_ca":false},{"name":"Pável Valtr","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01893516591749736,"gpt":0.2642083172706151,"spread":0.2452731513531178,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003724816,0.0009944073,0.001322806,0.001403247,0.001263668,0.00119485,0.001471352,0.001600137,0.009276235],"category_scores_gemma":[0.003092866,0.0008292324,0.0008586572,0.0009393776,0.0005942986,0.001604033,0.001763939,0.0009614203,0.001880637],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005308259,"about_ca_system_score_gemma":0.001164238,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002434743,"about_ca_topic_score_gemma":0.004760052,"domain_scores_codex":[0.9994137,0.00008001861,0.00003513126,0.0001262592,0.0002130779,0.0001317914],"domain_scores_gemma":[0.9991021,0.0003393106,0.00009887096,0.0001650239,0.0002008658,0.00009395222],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002495308,0.0007064877,0.01209738,0.0008309642,0.0003030651,0.001352676,0.001324611,0.450904,0.09401634,0.03658703,0.01153069,0.3878514],"study_design_scores_gemma":[0.00015285,0.000902824,0.002984797,0.0001606352,0.0001318079,0.0005245891,0.0008256153,0.8976529,0.04380885,0.035791,0.01700732,0.00005665557],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3143817,0.000213314,0.659613,0.000423468,0.0001358248,0.0005862334,0.0009703974,0.001643498,0.02203249],"genre_scores_gemma":[0.5012226,0.0001307978,0.4894582,0.00005723938,0.00001790128,0.0002862747,0.001265314,0.0003003138,0.007261423],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009276235,"threshold_uncertainty_score":0.03103215,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Hayri Ardal","is_ca":true},{"name":"Ján Maňuch","is_ca":true},{"name":"Moshe Rosenfeld","is_ca":false},{"name":"Saharon Shelah","is_ca":false},{"name":"Ladislav Stacho","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008770172417843971,"gpt":0.246519405989524,"spread":0.23774923357168,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012679,0.0003404647,0.0003353989,0.0008603373,0.0007708725,0.001234248,0.0007898242,0.0005452865,0.008933799],"category_scores_gemma":[0.0008883414,0.0002008352,0.0002034952,0.0007888223,0.0007295593,0.001529274,0.0008877867,0.001104176,0.001302246],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005163191,"about_ca_system_score_gemma":0.0003925787,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001973572,"about_ca_topic_score_gemma":0.001856137,"domain_scores_codex":[0.9998629,0.00002637861,0.000004571499,0.00003997256,0.0000410087,0.00002522428],"domain_scores_gemma":[0.9996208,0.00009597821,0.00006852682,0.00006456565,0.00007842266,0.00007175669],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001467013,0.00003381622,0.000994982,0.00009033945,0.0000127973,0.0001905128,0.0001571201,0.009227749,0.004298816,0.92584,0.007995488,0.05101169],"study_design_scores_gemma":[0.00003212884,0.00003215529,0.001020095,0.00002702332,0.00001789916,0.0003459718,0.0002260569,0.02986887,0.002055184,0.9209059,0.04545427,0.00001441633],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3738199,0.0008596933,0.4562883,0.002529745,0.0002921798,0.0001429043,0.002410907,0.0004433635,0.163213],"genre_scores_gemma":[0.8187991,0.001402969,0.1232218,0.0006551151,0.0001340542,0.0001164084,0.002664344,0.0002770788,0.05272917],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008933799,"threshold_uncertainty_score":0.0298866,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Efi Fogel","is_ca":false},{"name":"Dan Halperin","is_ca":false},{"name":"Christophe Weibel","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02933775667041619,"gpt":0.270314861022124,"spread":0.2409771043517079,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003157142,0.001539109,0.002311621,0.00184805,0.001360497,0.005244242,0.004353308,0.001778188,0.01132404],"category_scores_gemma":[0.02867046,0.001245497,0.00161078,0.00234389,0.003428885,0.01343497,0.005297714,0.004644096,0.001004748],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002051356,"about_ca_system_score_gemma":0.001242581,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001102925,"about_ca_topic_score_gemma":0.001670594,"domain_scores_codex":[0.9967637,0.001055188,0.0001988716,0.0005075336,0.001002127,0.0004724793],"domain_scores_gemma":[0.9777779,0.01802642,0.0007829607,0.001791984,0.0007437806,0.0008769304],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007137501,0.0001662413,0.002571837,0.0006500238,0.0001370653,0.0001790158,0.000547508,0.156517,0.00365956,0.7710406,0.01058294,0.05323447],"study_design_scores_gemma":[0.0000233251,0.00004163546,0.0006352302,0.0000431261,0.00003121741,0.0001218049,0.0001047099,0.2124938,0.001274318,0.7834216,0.001781334,0.00002787276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4165232,0.00459088,0.5040091,0.004517628,0.0006012766,0.0001306567,0.001732228,0.0007839514,0.06711102],"genre_scores_gemma":[0.9032258,0.001619248,0.08089972,0.0005266871,0.00061346,0.0001831216,0.001280996,0.000796374,0.01085463],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01132404,"threshold_uncertainty_score":0.03788269,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}