{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007349778,0.0003756218,0.000383797,0.0006476085,0.001202427,0.001185694,0.0006890995,0.0001351043,0.00002523886],"category_scores_gemma":[0.000364691,0.0003854494,0.0002699844,0.001326767,0.0001630705,0.001111816,0.0003636889,0.0002326487,0.0001490486],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001775573,"about_ca_system_score_gemma":0.0004108295,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001476349,"about_ca_topic_score_gemma":0.00000884742,"domain_scores_codex":[0.9967406,0.00009567892,0.0007077952,0.0009085795,0.0009594123,0.0005879146],"domain_scores_gemma":[0.9966626,0.001562178,0.0002854456,0.0003751437,0.0008723807,0.0002422714],"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.00004515409,0.00009357716,0.0001442458,0.00001780029,0.00006751285,0.000006709519,0.0005765758,0.5445561,0.00003713194,0.09562431,0.003024769,0.3558061],"study_design_scores_gemma":[0.001078121,0.0001606112,0.01492084,0.00004197899,0.00001802893,0.00006201548,0.0000634746,0.9188315,0.0003516004,0.02869147,0.03529747,0.0004828926],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05060617,0.0003053048,0.9446812,0.001994276,0.001056706,0.0004883299,0.00007947844,0.0002894758,0.0004990509],"genre_scores_gemma":[0.5559466,0.000003079674,0.4420235,0.0008931374,0.0006455305,0.00001557804,0.0002458802,0.00001969942,0.0002070832],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5053404,"threshold_uncertainty_score":0.9998598,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001038925,0.0002331537,0.0002806418,0.0005396499,0.0001975361,0.0001034493,0.000517706,0.0001112439,0.00003792627],"category_scores_gemma":[0.0001453927,0.00023558,0.0001918711,0.001100891,0.00005392835,0.001120839,0.0001951099,0.0001295771,0.00003471844],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007647603,"about_ca_system_score_gemma":0.0001261033,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000891499,"about_ca_topic_score_gemma":6.169718e-7,"domain_scores_codex":[0.9976764,0.000102697,0.0005874357,0.0004107709,0.0007944247,0.0004282869],"domain_scores_gemma":[0.9981891,0.0005259772,0.0003382232,0.0003035757,0.0004559947,0.0001871441],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007590061,0.0004461532,0.004295509,0.0002627284,0.0002353414,0.000001771295,0.001919606,0.3486917,0.001306191,0.4543125,0.002180538,0.186272],"study_design_scores_gemma":[0.001134962,0.0001715369,0.03629968,0.00002929716,0.00003353482,0.00004202946,0.0001214662,0.8761309,0.002953716,0.08027712,0.002338829,0.0004669389],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05725806,0.0002911488,0.9401873,0.0003775134,0.0007908574,0.0004706956,0.00009903681,0.00009737421,0.0004280181],"genre_scores_gemma":[0.7133355,0.000003499264,0.2854778,0.0001383448,0.0003473692,0.00006132437,0.0005363715,0.00001400361,0.00008585753],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6560774,"threshold_uncertainty_score":0.9606672,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005208691,0.0001213544,0.0001986534,0.000105454,0.0001367958,0.00001491372,0.0001793984,0.00007429619,0.00001808063],"category_scores_gemma":[0.001356388,0.00009480174,0.00007279506,0.0005512465,0.0001207996,0.00008460991,0.0001307118,0.000125891,0.00000228658],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005813453,"about_ca_system_score_gemma":0.00003619076,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005458933,"about_ca_topic_score_gemma":0.000005676661,"domain_scores_codex":[0.9987619,0.00004370213,0.0004069202,0.0001570546,0.0004514685,0.0001789845],"domain_scores_gemma":[0.9974858,0.001755009,0.0003066452,0.0002247633,0.0001711903,0.00005666435],"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.000008636467,0.00007555252,0.00838137,0.00008967474,0.0000396797,9.266814e-7,0.00042458,0.000932882,0.0001035716,0.9890608,0.0002476914,0.0006346464],"study_design_scores_gemma":[0.0003158446,0.00002532485,0.04226531,0.000053982,0.00003250868,0.000007714384,0.0001895401,0.001109915,0.0002988289,0.9553507,0.0002346808,0.0001156477],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7419125,0.00007254317,0.2530762,0.0002001747,0.0003121728,0.0002781903,0.00002819853,0.00005716834,0.004062826],"genre_scores_gemma":[0.9694691,0.00000315252,0.03016645,0.00004230689,0.00005749904,0.000003495918,0.00001074762,0.00002213288,0.0002250731],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2275566,"threshold_uncertainty_score":0.3865903,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007189911,0.0002154935,0.0002001972,0.0006131857,0.0001931158,0.0001561622,0.0006226037,0.00008623544,0.0001689181],"category_scores_gemma":[0.00006283366,0.0002101482,0.00007746338,0.001918622,0.00005969597,0.002136133,0.0002031376,0.0002082181,0.0001802385],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009368606,"about_ca_system_score_gemma":0.0001017898,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000187633,"about_ca_topic_score_gemma":0.000003683744,"domain_scores_codex":[0.9978286,0.0001922859,0.0003984374,0.0004487013,0.0006469956,0.0004849913],"domain_scores_gemma":[0.9986809,0.0003714593,0.0001192589,0.0003944326,0.0001582522,0.0002756805],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.00001269551,0.0003006261,0.02269609,0.000009287957,0.00001755637,0.000009015037,0.00063442,0.2508693,0.0004092331,0.7108425,0.0002980095,0.01390128],"study_design_scores_gemma":[0.0004855723,0.00009400368,0.6631436,0.00002460611,0.000007258678,0.00003571104,0.00005292406,0.2729877,0.0002357686,0.06062058,0.00186059,0.0004516921],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4103708,0.000463619,0.5856595,0.0006138544,0.0008714023,0.0001685702,0.000008556426,0.0001526596,0.001691083],"genre_scores_gemma":[0.9272645,0.000005319422,0.07120722,0.0009290761,0.0002956853,0.00002274218,0.0001257324,0.00001371233,0.0001360912],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6502219,"threshold_uncertainty_score":0.8569596,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001782149,0.0002290818,0.0003159613,0.0001608901,0.0001428561,0.00007554527,0.0001858657,0.00006980957,0.00004733131],"category_scores_gemma":[0.000414465,0.0001912751,0.0000828231,0.0003193945,0.00007094121,0.0001989425,0.00007281035,0.0001513551,0.00002454547],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003687639,"about_ca_system_score_gemma":0.00002870603,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001405659,"about_ca_topic_score_gemma":4.842383e-7,"domain_scores_codex":[0.9988135,0.00003708758,0.0003384406,0.0002691547,0.0002844188,0.0002574405],"domain_scores_gemma":[0.9985517,0.0008563307,0.0001524463,0.0002245355,0.0001067107,0.000108229],"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.00002482668,0.0001382524,0.0006226689,0.00007250904,0.00005594538,0.000006160174,0.0006582579,0.000457137,0.0002261291,0.9848303,0.00115627,0.01175155],"study_design_scores_gemma":[0.0004017,0.0001090807,0.00539036,0.00004159804,0.00001542777,0.00003138822,0.0002402028,0.004606167,0.0001911678,0.9882849,0.0004530535,0.000234919],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8186098,0.000481703,0.176283,0.0008801486,0.0002338795,0.0003011872,0.00003484748,0.0002639955,0.002911482],"genre_scores_gemma":[0.9349277,0.000007741432,0.06437595,0.000226137,0.000132665,0.0000058302,0.00001953236,0.000024581,0.0002798405],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.116318,"threshold_uncertainty_score":0.7799974,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0005717736,0.0003081118,0.0002906633,0.0006434997,0.0007018498,0.0005059381,0.0009080007,0.00009029847,0.0009549916],"category_scores_gemma":[0.00007920709,0.0003175152,0.0001620453,0.002823028,0.00003837011,0.0009054299,0.0003821457,0.0001926563,0.001327337],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009952211,"about_ca_system_score_gemma":0.0001872142,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004071218,"about_ca_topic_score_gemma":0.000005956685,"domain_scores_codex":[0.996807,0.000113912,0.0005319182,0.0008324338,0.0009601374,0.000754619],"domain_scores_gemma":[0.9984506,0.0002869803,0.00009096247,0.000487458,0.0002878735,0.0003960878],"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.00001778499,0.00009594368,0.0004307463,0.0000112354,0.00004364006,0.00001469516,0.0003258327,0.8327644,0.0003778479,0.05687309,0.01091945,0.09812533],"study_design_scores_gemma":[0.00113145,0.0003118295,0.04924025,0.00007276644,0.00002748204,0.0001080684,0.00004607561,0.808436,0.0007778331,0.04394246,0.09476218,0.001143596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1870465,0.0003005449,0.8018219,0.001950582,0.0004448138,0.0002856787,0.00003338266,0.0002750593,0.007841528],"genre_scores_gemma":[0.8244002,0.0000138658,0.1682724,0.002737567,0.0003253194,0.00004074526,0.0002402542,0.00002378278,0.003945918],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6373537,"threshold_uncertainty_score":0.9999583,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001487502,0.0002473613,0.0002606859,0.002104212,0.0003006702,0.0002284192,0.000873816,0.00009559473,0.00001865608],"category_scores_gemma":[0.0002728806,0.0002335735,0.0001166623,0.005513709,0.0003019623,0.0007506135,0.0004477109,0.0003453355,0.00004548696],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005362235,"about_ca_system_score_gemma":0.00005831733,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001640411,"about_ca_topic_score_gemma":0.000004461594,"domain_scores_codex":[0.9972044,0.0001030574,0.0003852338,0.00069517,0.0009483669,0.0006638002],"domain_scores_gemma":[0.997148,0.001718175,0.0001312947,0.0004492708,0.000225603,0.0003276888],"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.0001216685,0.0001776351,0.03602981,0.00007903038,0.0001782804,0.0001697805,0.0005857064,0.03438014,0.0001848016,0.6311395,0.0002991843,0.2966544],"study_design_scores_gemma":[0.00122589,0.0002838095,0.3943202,0.00003516879,0.00001528093,0.0001916967,0.0002032743,0.03402014,0.0004358095,0.5677725,0.000749786,0.0007464034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2236431,0.0005106842,0.774095,0.0002579382,0.0001734039,0.0001724493,0.000009233651,0.0001479995,0.0009902084],"genre_scores_gemma":[0.8356196,0.00001902498,0.1638051,0.0003610163,0.00003484578,0.00000847861,0.0000237424,0.00001788834,0.0001103529],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6119765,"threshold_uncertainty_score":0.952485,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008758011,0.00009210501,0.0001400816,0.00004734336,0.00005552747,0.00002586386,0.00009852085,0.00002864282,0.00005216519],"category_scores_gemma":[0.00002553101,0.00005233839,0.00008644102,0.0005181542,0.0000254081,0.00006640532,0.000009887186,0.00004864678,0.000005796762],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002692834,"about_ca_system_score_gemma":0.000004390539,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005823239,"about_ca_topic_score_gemma":7.192305e-7,"domain_scores_codex":[0.9994401,0.00002328715,0.0001603771,0.00008361468,0.0001938756,0.0000987447],"domain_scores_gemma":[0.9997213,0.0001041263,0.0000369893,0.00007598934,0.00003575262,0.00002584837],"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.000005566846,9.882779e-7,0.00649706,0.000007758083,0.00003820055,4.906894e-7,0.00001305387,0.9816267,0.00001971293,0.001242132,0.0001781902,0.0103701],"study_design_scores_gemma":[0.0002202577,0.00007213943,0.2512627,0.00001157137,0.00004053956,0.000004699931,0.000009767457,0.745208,0.0002395547,0.002740275,0.00009925315,0.0000912078],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9103726,0.0002886143,0.08663784,0.0001209712,0.0001270523,0.00008258972,0.00002298404,0.00007517957,0.002272194],"genre_scores_gemma":[0.9987,0.000004351786,0.001100555,0.00004293497,0.00005538686,0.000001223557,0.00008202359,0.000003826299,0.000009685498],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2447656,"threshold_uncertainty_score":0.2134298,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007505699,0.0001344222,0.0001394011,0.0001807049,0.00009345117,0.0000606377,0.00007931846,0.00005157357,0.0005622067],"category_scores_gemma":[0.00003665178,0.000125154,0.0001017813,0.0005230965,0.00002121131,0.0001381863,0.00001139193,0.0001060781,0.00005432443],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003307069,"about_ca_system_score_gemma":0.00001316379,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002896428,"about_ca_topic_score_gemma":5.117749e-7,"domain_scores_codex":[0.9991981,0.00001971816,0.0002057415,0.0001538122,0.0002440179,0.0001785452],"domain_scores_gemma":[0.9996973,0.00007009282,0.00002553894,0.00008219753,0.00005706152,0.00006783893],"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":[8.278013e-7,0.000002793008,0.003061815,0.00001045407,0.00006587524,0.000001693038,0.00004653535,0.990397,0.000104076,0.004502418,0.0003024183,0.001504089],"study_design_scores_gemma":[0.000442835,0.00001707358,0.07126084,0.0000206124,0.00005137405,0.00002040258,0.0001254948,0.9169537,0.0008108798,0.007327325,0.00254939,0.0004200995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7508706,0.0008355101,0.2407881,0.0000635899,0.0006832525,0.00007650953,0.0000230458,0.000243397,0.006415972],"genre_scores_gemma":[0.9876841,0.00001451338,0.01171044,0.00008374045,0.00008453477,0.000003498694,0.0001618294,0.00001966304,0.0002376852],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2368135,"threshold_uncertainty_score":0.6155769,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002368665,0.0001894726,0.000171512,0.000213695,0.0002700262,0.0003126774,0.000616536,0.00004559015,0.00002190975],"category_scores_gemma":[0.00004276154,0.0001560321,0.00006896237,0.0008068171,0.00005804997,0.001212194,0.0002063568,0.0003128414,0.0001069698],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006139259,"about_ca_system_score_gemma":0.0001197072,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001315199,"about_ca_topic_score_gemma":7.223324e-7,"domain_scores_codex":[0.9983897,0.00002915644,0.0001994794,0.0004466695,0.0006289641,0.0003060487],"domain_scores_gemma":[0.99928,0.0001173543,0.0001166598,0.0002579419,0.000103749,0.0001242432],"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.0000107882,0.00004991479,0.00146107,0.00002465291,0.00004925363,0.00006198059,0.001596704,0.8013075,0.00003748242,0.1827022,0.0000646519,0.01263382],"study_design_scores_gemma":[0.002763709,0.0004235685,0.04771915,0.0002445238,0.00002224744,0.000381961,0.000185621,0.8319869,0.0002932661,0.1105192,0.004345278,0.001114608],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.066867,0.00007270228,0.9274619,0.002374022,0.0001715158,0.00008054327,0.000002306154,0.000340487,0.002629552],"genre_scores_gemma":[0.7209353,0.000001514072,0.2775156,0.001284558,0.00007799036,0.000004803258,0.0000218687,0.00001407381,0.0001442413],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6540684,"threshold_uncertainty_score":0.6362803,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003325313,0.0001877023,0.0002093369,0.0004283527,0.0001760759,0.0001933955,0.0003293704,0.00006246309,0.0001036838],"category_scores_gemma":[0.0001602814,0.0001895978,0.00006140087,0.001385348,0.00009907829,0.0007507252,0.0002260875,0.0001666836,0.0000489885],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006504263,"about_ca_system_score_gemma":0.00003917255,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004022175,"about_ca_topic_score_gemma":0.00002372729,"domain_scores_codex":[0.9982278,0.00009369107,0.0003855592,0.0005721027,0.0003997942,0.0003210773],"domain_scores_gemma":[0.9990301,0.0003471662,0.00009760471,0.0002682061,0.0001290518,0.0001278776],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003527855,0.0004216215,0.05301203,0.00009175942,0.00006116446,0.0000664723,0.002069225,0.2576737,0.0002346769,0.5357277,0.004500812,0.1461056],"study_design_scores_gemma":[0.000535472,0.00006911775,0.24474,0.00001612757,0.000003029206,0.00003840699,0.00005134558,0.6851306,0.00004534786,0.06683482,0.002264115,0.0002716178],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.379758,0.000654985,0.6159132,0.001759524,0.0001751142,0.0001854389,0.00002098786,0.0001086627,0.001424044],"genre_scores_gemma":[0.9645293,0.00002680881,0.0344454,0.0006211186,0.00006161329,0.00001670624,0.00004710511,0.000008659456,0.0002433138],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5847713,"threshold_uncertainty_score":0.7731574,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001692903,0.0001976963,0.00034025,0.000216903,0.00009803651,0.0000223553,0.0002178857,0.00006571561,0.00002456169],"category_scores_gemma":[0.00067551,0.0001706033,0.0001329099,0.0005691596,0.000167555,0.0001920373,0.00008121892,0.0001493244,0.00002124034],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007917078,"about_ca_system_score_gemma":0.0001050595,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009722689,"about_ca_topic_score_gemma":0.000001505855,"domain_scores_codex":[0.998511,0.00003846579,0.0004699933,0.0002247825,0.0005439146,0.0002118327],"domain_scores_gemma":[0.9988735,0.0002853367,0.0002666976,0.0002220869,0.0002807849,0.00007153852],"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.00003120582,0.0001836883,0.0001614732,0.0001974175,0.0001003089,0.000003733936,0.001511958,0.01259056,0.0006732083,0.9843105,0.00005451675,0.0001814105],"study_design_scores_gemma":[0.0007892963,0.00009254554,0.0003762597,0.0001675772,0.00002441457,0.000008936931,0.0005074238,0.0004058694,0.005808319,0.9915859,0.00003066952,0.0002028485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8951554,0.0001665237,0.1026433,0.000158387,0.0003270761,0.0003434674,0.00002110074,0.0001040469,0.001080688],"genre_scores_gemma":[0.9353168,0.000003012327,0.06447005,0.00003777782,0.00003704091,0.00002163946,0.00001254893,0.00003086753,0.0000702504],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04016137,"threshold_uncertainty_score":0.6956999,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002824545,0.000338673,0.0003163082,0.0004353634,0.0004788111,0.0006761295,0.000783184,0.00008055003,0.0001931867],"category_scores_gemma":[0.00003949202,0.0002996192,0.0001284161,0.001867995,0.0001800866,0.001179038,0.0003360284,0.0002646458,0.0004102456],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007806247,"about_ca_system_score_gemma":0.0001698334,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001134267,"about_ca_topic_score_gemma":0.000005474636,"domain_scores_codex":[0.9971964,0.0001155094,0.0004758825,0.0007425467,0.0009315667,0.0005381411],"domain_scores_gemma":[0.9981358,0.0003348465,0.0002162549,0.0004181027,0.0006169913,0.0002780021],"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.00001411245,0.0001475459,0.003169625,0.00002932314,0.0001050609,0.00001607672,0.0004248023,0.8059142,0.0001011,0.144055,0.001773676,0.04424954],"study_design_scores_gemma":[0.000719701,0.0002202789,0.1015947,0.00003002263,0.00001172741,0.0001146334,0.00009218723,0.8788748,0.0001259858,0.01650029,0.001210399,0.0005052632],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.263259,0.00008815843,0.7333792,0.0009465041,0.0002179374,0.0003370144,0.000008219828,0.0002853357,0.001478683],"genre_scores_gemma":[0.6790906,0.00000115349,0.3198209,0.0005841574,0.0001448938,0.00002261154,0.0001905139,0.00001624196,0.0001289541],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4158316,"threshold_uncertainty_score":0.9999456,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004787654,0.0003474555,0.000309568,0.001465897,0.0004060178,0.0004444686,0.000896071,0.0001258069,0.00009458861],"category_scores_gemma":[0.00009606362,0.0003559466,0.000217393,0.004807756,0.00007816735,0.0009541778,0.0003243939,0.0002426211,0.0003942313],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001311723,"about_ca_system_score_gemma":0.0001789595,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008808787,"about_ca_topic_score_gemma":0.000006639902,"domain_scores_codex":[0.9968008,0.000109734,0.0006389147,0.0008463837,0.001059673,0.0005445057],"domain_scores_gemma":[0.9982723,0.0004118576,0.000240607,0.0004448037,0.0004495202,0.0001809316],"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.00001100181,0.0004272768,0.003224817,0.00003056502,0.00007293951,0.00004762496,0.00006717235,0.838908,0.0004476481,0.1047339,0.005849234,0.04617989],"study_design_scores_gemma":[0.001012148,0.00008317483,0.2090253,0.0000132663,0.00001393827,0.00006779417,0.00001374581,0.7605293,0.0003606658,0.02126133,0.007077001,0.0005423093],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02660829,0.0006960067,0.9688197,0.0007009528,0.0008062808,0.000258255,0.00003783391,0.0003904123,0.001682212],"genre_scores_gemma":[0.6222526,0.000005254102,0.3755617,0.0003664935,0.0003497509,0.00002718228,0.0003868573,0.00001953326,0.00103067],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5956443,"threshold_uncertainty_score":0.9998893,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000306134,0.0001483431,0.0002280127,0.0001272977,0.0001240084,0.0000983775,0.00009593059,0.00007798043,0.0000416583],"category_scores_gemma":[0.0002128479,0.0001306424,0.00005294172,0.0002398879,0.00006824867,0.000161367,0.0000569156,0.0001145592,0.00003325266],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003200274,"about_ca_system_score_gemma":0.0000267191,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007455405,"about_ca_topic_score_gemma":0.000001176756,"domain_scores_codex":[0.998858,0.00003110314,0.0003245213,0.0002258866,0.000359865,0.0002006256],"domain_scores_gemma":[0.9989828,0.0005313447,0.0001131482,0.000147939,0.0001110287,0.0001137739],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001043236,0.00005993458,0.0005619887,0.000149,0.00003419778,0.000009094044,0.00008917952,0.04373822,0.00001121539,0.9548236,0.000165466,0.0003476373],"study_design_scores_gemma":[0.0001546157,0.00001044809,0.0008688632,0.00003392933,0.00001965934,0.00003953349,0.00003245859,0.6048188,5.266211e-7,0.393827,0.00009002961,0.0001040953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5010795,0.0001148329,0.4934493,0.000120498,0.0000587857,0.0001581242,0.00003458656,0.00005839359,0.004925981],"genre_scores_gemma":[0.9657652,0.00001681484,0.03350822,0.00007457154,0.00004057445,0.00001347923,0.00006192971,0.00001870135,0.000500473],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5610806,"threshold_uncertainty_score":0.5327443,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000128435,0.0001034342,0.0001357093,0.0001798779,0.0001226345,0.00005318288,0.000179218,0.00007418753,0.0001516573],"category_scores_gemma":[0.0001550058,0.00007168674,0.0001028532,0.001214331,0.00005789802,0.00007709695,0.00002854946,0.0002423235,0.00002104436],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001358726,"about_ca_system_score_gemma":0.00001240757,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001153767,"about_ca_topic_score_gemma":0.000004993641,"domain_scores_codex":[0.9992033,0.00001280382,0.0002501113,0.000109882,0.0002840259,0.0001398317],"domain_scores_gemma":[0.9991964,0.0004239896,0.00006391949,0.0001517359,0.0001164457,0.00004757769],"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.000004951236,0.000005756003,0.003780352,0.00002082648,0.00008600108,5.984633e-7,0.00003297897,0.9072632,0.000175475,0.08199622,0.0002998488,0.006333857],"study_design_scores_gemma":[0.0001158299,0.00001353016,0.1095288,0.00001005088,0.00003416671,0.000004839636,0.00003039897,0.845619,0.0002693105,0.04314522,0.001072583,0.0001562148],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8708957,0.0004151893,0.1264312,0.0001151952,0.0006380109,0.00008670511,0.00003163422,0.00009076666,0.001295595],"genre_scores_gemma":[0.97949,0.00002747778,0.0202305,0.00001502776,0.0001244298,0.00000374556,0.00005417399,0.00001263848,0.00004201708],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1085942,"threshold_uncertainty_score":0.2923301,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002908167,0.0001750484,0.0001722409,0.0001098107,0.0004453528,0.0002402528,0.0008741896,0.00005176215,0.00007508951],"category_scores_gemma":[0.00009234768,0.0001349834,0.0001834063,0.0004682061,0.0001135667,0.0005413577,0.0002867473,0.0001222615,0.00001419168],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002394634,"about_ca_system_score_gemma":0.00005006762,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001220714,"about_ca_topic_score_gemma":0.000006374723,"domain_scores_codex":[0.9986798,0.00005697181,0.0002902365,0.0004157671,0.0002858432,0.0002714191],"domain_scores_gemma":[0.9986401,0.0006131877,0.0001364313,0.0003843599,0.0001644134,0.00006153269],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001442853,0.0002513768,0.005649996,0.00006248725,0.0004816877,0.000005147175,0.01280839,0.004022911,0.0006321333,0.8047321,0.003405285,0.1678042],"study_design_scores_gemma":[0.000385042,0.00008452735,0.02995975,0.000009253992,0.0000132601,0.000003513578,0.0002436043,0.6569326,0.0004379577,0.3098722,0.001824035,0.0002342692],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02799734,0.000120724,0.9699818,0.0003234723,0.0003624152,0.0003221137,0.00008838413,0.0001386723,0.0006650144],"genre_scores_gemma":[0.6424993,0.000001302046,0.3567404,0.000397671,0.0001342771,0.00005265754,0.0001416,0.00001035411,0.00002245245],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6529096,"threshold_uncertainty_score":0.5504462,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006368966,0.0003070738,0.0002837818,0.0007785611,0.0004318947,0.0002451678,0.0008553736,0.0001230994,0.0001350582],"category_scores_gemma":[0.000220855,0.0003215922,0.0002158796,0.001731661,0.00007125393,0.001376705,0.0002381988,0.0001736193,0.0001679777],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009409517,"about_ca_system_score_gemma":0.0002153512,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002313254,"about_ca_topic_score_gemma":0.000004032775,"domain_scores_codex":[0.9973693,0.00008711159,0.0006032343,0.0007709532,0.0007071599,0.0004622801],"domain_scores_gemma":[0.9980587,0.0004384144,0.0002728302,0.0004332789,0.0005927487,0.0002039633],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001097699,0.0003108701,0.003081414,0.0001005891,0.0001545002,0.00001649319,0.001309014,0.09065184,0.0008958572,0.8452475,0.003592325,0.05452985],"study_design_scores_gemma":[0.001418031,0.0005182626,0.07986579,0.00004597342,0.00004350818,0.0001058905,0.0000911805,0.6540489,0.0037264,0.253983,0.005162737,0.0009903385],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05883852,0.0002803628,0.9375119,0.0003541336,0.0007971075,0.000481588,0.00004243202,0.0002603046,0.00143369],"genre_scores_gemma":[0.6729565,0.000006353452,0.3255861,0.0006066659,0.0002159652,0.00008973155,0.0002480853,0.00001894396,0.0002716705],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6141179,"threshold_uncertainty_score":0.9999236,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002783814,0.000119654,0.0001908698,0.00008753123,0.0001511864,0.0000751722,0.00009718823,0.00005783052,0.0001845916],"category_scores_gemma":[0.0001479427,0.00009436596,0.0000738919,0.0001601833,0.0001786175,0.0002076163,0.0000116542,0.0000463451,0.00001049381],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004499873,"about_ca_system_score_gemma":0.0000677633,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008357941,"about_ca_topic_score_gemma":0.000004944257,"domain_scores_codex":[0.9989402,0.00007409042,0.0003091137,0.0002194112,0.0002822942,0.0001748921],"domain_scores_gemma":[0.9993338,0.0001647686,0.0001920617,0.00009506813,0.0001643322,0.00004999155],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001664622,0.00005232422,0.001321225,0.0003257839,0.000036862,0.000003019779,0.0002846055,0.1818553,0.5894064,0.2259239,0.0003339312,0.0002901572],"study_design_scores_gemma":[0.003639961,0.001102338,0.03941758,0.0004269078,0.0001682335,0.0003513205,0.003347494,0.03241552,0.7061923,0.1970026,0.01444516,0.001490584],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9110417,0.0006674249,0.0865386,0.00006593228,0.0007035873,0.0003361643,0.0002749061,0.00003367219,0.0003379649],"genre_scores_gemma":[0.9940981,0.000007179649,0.005608432,0.00003048851,0.00006629599,0.00002385558,0.000104448,0.000008609177,0.00005262138],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1494398,"threshold_uncertainty_score":0.3848132,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003566226,0.0001314808,0.0002182862,0.0001087469,0.00009165963,0.00002883753,0.0001499875,0.00005960529,0.0001090291],"category_scores_gemma":[0.0004059483,0.0000893354,0.0001188419,0.000242866,0.00001997508,0.00006526376,0.00002025315,0.00008086863,0.00001171306],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002012268,"about_ca_system_score_gemma":0.00002187812,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.777842e-7,"about_ca_topic_score_gemma":1.051434e-7,"domain_scores_codex":[0.9989475,0.0000277224,0.0003820226,0.0001678317,0.0003298481,0.000145094],"domain_scores_gemma":[0.9980516,0.001334685,0.0002294517,0.0001756541,0.0001687216,0.00003991118],"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.0000400065,0.0002417319,0.00001225963,0.00009628507,0.00002975704,4.073634e-7,0.0002079895,0.0004369883,0.002573916,0.9939929,0.0002993312,0.002068473],"study_design_scores_gemma":[0.0002825661,0.0001751512,0.002207932,0.00007183125,0.00002527944,0.000001538236,0.00002342157,0.1553234,0.000439227,0.8411749,0.0001615868,0.0001131528],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7129349,0.000004116394,0.2842306,0.001126551,0.00005137955,0.0004351021,0.0001021866,0.00004841485,0.001066788],"genre_scores_gemma":[0.9807337,0.000002292737,0.01832428,0.0003960454,0.00005863002,0.00001713145,0.0002778039,0.00001571298,0.0001743961],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2677988,"threshold_uncertainty_score":0.3642992,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003978934,0.000110068,0.0001750357,0.00009262493,0.00007308346,0.00001971213,0.0001507571,0.00004567962,0.0001777642],"category_scores_gemma":[0.0005299468,0.00006317157,0.00007577024,0.0003908778,0.00009222493,0.00008423307,0.00003415366,0.0001027682,0.0000116601],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002541145,"about_ca_system_score_gemma":0.00002981012,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008407892,"about_ca_topic_score_gemma":0.00001520617,"domain_scores_codex":[0.9988735,0.00002544885,0.0003666769,0.0001259092,0.0004752549,0.0001331758],"domain_scores_gemma":[0.9983851,0.001046958,0.0002218066,0.0001568052,0.0001445467,0.00004483034],"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.0001711502,0.0002098567,0.00519975,0.0002354297,0.00007655837,0.000001711278,0.0008033389,0.0007444844,0.0003208365,0.9897895,0.0008649018,0.001582407],"study_design_scores_gemma":[0.002852509,0.0002670406,0.08150619,0.0003635007,0.00008722222,0.00005186474,0.001428082,0.046062,0.01382172,0.8513553,0.001726819,0.0004778272],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5936434,0.000008849732,0.4000057,0.0001652938,0.00004361773,0.0002368402,0.00002427977,0.00003437201,0.00583763],"genre_scores_gemma":[0.9256011,3.098879e-7,0.07388123,0.00009653668,0.00003114174,0.000005226322,0.00003008317,0.00001232952,0.0003420428],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3319576,"threshold_uncertainty_score":0.2576062,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001048458,0.0001618121,0.0002053814,0.0004097447,0.0002252701,0.0001438229,0.0001865259,0.00005620157,0.00000246009],"category_scores_gemma":[0.00009806485,0.0001372169,0.00002875738,0.0007533108,0.0001430359,0.0003500893,0.0002727804,0.0001571698,8.192479e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001986547,"about_ca_system_score_gemma":0.00005314024,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004576581,"about_ca_topic_score_gemma":0.00003571593,"domain_scores_codex":[0.9985252,0.0000822915,0.0004331996,0.0003793984,0.0003492188,0.0002307002],"domain_scores_gemma":[0.9985163,0.0009820642,0.0001743722,0.0001341899,0.0001051472,0.00008797925],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.0000517898,0.0001000871,0.1480648,0.0001034399,0.00008267302,0.00003081587,0.004954621,0.2808716,0.001193342,0.1548139,0.00007927535,0.4096538],"study_design_scores_gemma":[0.0003444832,0.0000439044,0.5681751,0.0000326294,0.000006218303,0.00004361472,0.0001901106,0.4254461,0.00009878838,0.005428741,0.00007216898,0.0001181276],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5352417,0.0009974395,0.4631998,0.0002837197,0.00006039382,0.000102073,0.000003306915,0.00001770922,0.00009392543],"genre_scores_gemma":[0.943967,0.00002917058,0.05568005,0.0002031207,0.0000730519,0.000001942926,0.00002117452,0.000007233175,0.0000172662],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4201104,"threshold_uncertainty_score":0.5595544,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005048872,0.0001557157,0.000210613,0.0005880783,0.00006189374,0.00003724014,0.0003553187,0.00004335437,0.0001093867],"category_scores_gemma":[0.0002450579,0.000158261,0.00008225509,0.001660307,0.00003581518,0.0003317014,0.00005878742,0.0001197237,0.00004481109],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004669912,"about_ca_system_score_gemma":0.000120506,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005430294,"about_ca_topic_score_gemma":0.000001870508,"domain_scores_codex":[0.9982042,0.0001423642,0.0004217245,0.0003732429,0.000642182,0.0002163281],"domain_scores_gemma":[0.9989725,0.0004050394,0.000150763,0.0002391527,0.0001624734,0.00007012481],"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.000009028916,0.0002197752,0.002503043,0.00008217333,0.00003067385,0.000007542821,0.0001325882,0.3735642,0.0001569186,0.6169456,0.000946097,0.005402427],"study_design_scores_gemma":[0.002871807,0.0004889582,0.4053306,0.0006190758,0.00001693346,0.00002970872,0.0000564372,0.1678294,0.003916097,0.4156903,0.002284483,0.0008662185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1910279,0.0005830253,0.8013251,0.0003849223,0.000358716,0.0002369881,0.0000209489,0.00004397819,0.006018467],"genre_scores_gemma":[0.9688122,0.00001327897,0.03013276,0.0008160659,0.0000184533,0.00001406709,0.00004692396,0.000007673546,0.000138579],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7777843,"threshold_uncertainty_score":0.6453695,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005635908,0.0002413096,0.0002737627,0.0007273112,0.0002980843,0.0002388262,0.0005004055,0.0001032592,0.0002655296],"category_scores_gemma":[0.0002380998,0.0002426235,0.0001280074,0.002575515,0.00009638308,0.0006352747,0.00009527611,0.0002579637,0.0001567959],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008873449,"about_ca_system_score_gemma":0.0002125556,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002166214,"about_ca_topic_score_gemma":0.00001402552,"domain_scores_codex":[0.9975579,0.0002690586,0.0005469114,0.0006204112,0.0005795419,0.0004262258],"domain_scores_gemma":[0.998604,0.0005530167,0.0001359018,0.0003174296,0.0002271387,0.0001625183],"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.000004755323,0.00009722851,0.001708568,0.000006664237,0.00001486661,0.00001434004,0.00009766682,0.2025409,0.0001970658,0.7938515,0.0003116807,0.001154751],"study_design_scores_gemma":[0.001389012,0.0001745979,0.09754182,0.00002623865,0.000009395672,0.0001059785,0.0001164173,0.2819914,0.0003306142,0.6038411,0.01382504,0.0006483621],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1049976,0.0002825602,0.8801593,0.0009455526,0.0004887289,0.0003155175,0.00002329391,0.0001520629,0.01263533],"genre_scores_gemma":[0.9223462,0.0000082267,0.07632601,0.0008177335,0.00003734763,0.00004315987,0.0001574837,0.0000103439,0.0002534756],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8173486,"threshold_uncertainty_score":0.9893901,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003868659,0.0001988846,0.0002966872,0.0006562229,0.0003092229,0.0001837827,0.0009408918,0.0001335243,0.0001536309],"category_scores_gemma":[0.0002071108,0.000171652,0.0002190917,0.00194332,0.0002031681,0.0004553973,0.0002655903,0.0002416229,0.0000864677],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002165807,"about_ca_system_score_gemma":0.00005845919,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004372798,"about_ca_topic_score_gemma":0.000004966297,"domain_scores_codex":[0.9981591,0.00004646951,0.0003568695,0.0006512889,0.000400544,0.0003857977],"domain_scores_gemma":[0.99848,0.0004601066,0.0001634603,0.000453221,0.000283183,0.000159985],"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.00001051601,0.0001897373,0.000608234,0.00001280478,0.000157272,0.00001309715,0.00006814477,0.004338244,0.0006832602,0.4731775,0.004524031,0.5162172],"study_design_scores_gemma":[0.000825994,0.0002889959,0.03386761,0.000004969072,0.00005430488,0.0001565214,0.00005794623,0.5365965,0.0005145468,0.3917124,0.03535966,0.0005605799],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03768156,0.00009313891,0.9590135,0.001568515,0.0009163794,0.000180574,0.0001560628,0.0001687736,0.0002214517],"genre_scores_gemma":[0.4453767,0.000004253065,0.5527633,0.0004035869,0.0003433378,0.00004182015,0.0006173013,0.00001045207,0.0004392091],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5322582,"threshold_uncertainty_score":0.6999764,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004912054,0.0003487024,0.0003843454,0.001004509,0.0002898431,0.0002121933,0.000708651,0.0001597215,0.00004710357],"category_scores_gemma":[0.00007008442,0.0003433358,0.0001948485,0.001629417,0.0002491681,0.0006436804,0.0001814143,0.0003545184,0.00001809814],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000127051,"about_ca_system_score_gemma":0.0001383921,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000891164,"about_ca_topic_score_gemma":0.00005608047,"domain_scores_codex":[0.9975525,0.00008683395,0.0006123378,0.000711285,0.0006442602,0.0003927862],"domain_scores_gemma":[0.998408,0.0003151533,0.0003172088,0.0004317934,0.0002879511,0.000239849],"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.00005520098,0.0001141604,0.01590568,0.00006417344,0.0001363832,0.00001404954,0.0005231761,0.01121566,0.001867071,0.9628653,0.0007806469,0.006458478],"study_design_scores_gemma":[0.001704742,0.0004246402,0.1664409,0.00006369123,0.00005567103,0.0003299568,0.0001019249,0.06387415,0.0008550401,0.7558579,0.009259636,0.00103182],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6458119,0.0003120838,0.3507937,0.0007769669,0.0007649471,0.0003014489,0.0001135867,0.0001853075,0.0009400478],"genre_scores_gemma":[0.8252449,0.000017376,0.1735533,0.0007442452,0.00006200237,0.00001946113,0.0001715235,0.00002426495,0.0001629192],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2070075,"threshold_uncertainty_score":0.9999019,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003618738,0.0002446525,0.0002503786,0.000824552,0.0002486881,0.0001723407,0.0003907646,0.00009075938,0.00004843656],"category_scores_gemma":[0.00008789342,0.0002496954,0.00007851642,0.00213253,0.00008912144,0.0005829674,0.0003085332,0.0002206441,0.00005063458],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007202214,"about_ca_system_score_gemma":0.0001530333,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000410741,"about_ca_topic_score_gemma":0.00005946698,"domain_scores_codex":[0.9978648,0.00008035875,0.0004375331,0.0006293139,0.0005933333,0.0003946609],"domain_scores_gemma":[0.9988704,0.000387936,0.0001143863,0.0002694862,0.0001619203,0.0001958193],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006390816,0.0002740203,0.04549062,0.00002339145,0.00007019196,0.0001249715,0.0005890211,0.3198875,0.0004236932,0.5937101,0.0003320281,0.0390106],"study_design_scores_gemma":[0.0008268754,0.00007759535,0.2926776,0.00002512815,0.000005899739,0.0001186696,0.00003650084,0.6370692,0.00003111379,0.06793947,0.000884559,0.0003073413],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.494498,0.0003573077,0.5028656,0.001374416,0.0001956919,0.0001564191,0.000007912282,0.00008437352,0.0004602738],"genre_scores_gemma":[0.9585799,0.00002764336,0.04018155,0.0007340426,0.0001221172,0.00002095163,0.0001093787,0.00001361297,0.0002108012],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5257706,"threshold_uncertainty_score":0.9999955,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004019848,0.0003493956,0.0003265725,0.0004939637,0.0004525904,0.0003998473,0.0006284631,0.0001070701,0.00002527254],"category_scores_gemma":[0.00008369046,0.0003305576,0.0001984583,0.001269368,0.0000623309,0.0007433921,0.00008655916,0.0001709735,0.0000401951],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007741091,"about_ca_system_score_gemma":0.0001610949,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005913173,"about_ca_topic_score_gemma":9.544748e-7,"domain_scores_codex":[0.9973982,0.00007610516,0.0005037196,0.0007699732,0.0007670038,0.0004850022],"domain_scores_gemma":[0.9984001,0.000499017,0.0001994461,0.0003481487,0.0003634287,0.0001898435],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001059543,0.0003598758,0.0002662042,0.00002283031,0.00008021801,0.00001808674,0.0003256324,0.3887698,0.0003458557,0.4957277,0.002174592,0.1118033],"study_design_scores_gemma":[0.0007156544,0.0006349743,0.02450237,0.0000302404,0.00001291734,0.00002577763,0.00002964245,0.8675913,0.0006169261,0.1035094,0.00187261,0.0004582434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08329514,0.0002830932,0.9118181,0.002452515,0.0005783291,0.000476718,0.0001004438,0.0003094117,0.000686233],"genre_scores_gemma":[0.777102,0.000009116568,0.2204607,0.001266361,0.0002709958,0.00003528528,0.0006195717,0.00001544817,0.0002205458],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6938068,"threshold_uncertainty_score":0.9999146,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003639614,0.0002184345,0.0002107712,0.0003318005,0.0002807915,0.0002171218,0.0003993655,0.00007289747,0.00002365587],"category_scores_gemma":[0.0002010923,0.0001725945,0.0001054759,0.0004882645,0.00009077775,0.0006231417,0.0001951723,0.00006367979,0.00003293962],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004709339,"about_ca_system_score_gemma":0.0001142993,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002379436,"about_ca_topic_score_gemma":7.166186e-7,"domain_scores_codex":[0.9982092,0.00004399618,0.0003618681,0.0006313466,0.0004113417,0.0003422656],"domain_scores_gemma":[0.9981745,0.001009793,0.0001449963,0.0002137097,0.0002804894,0.0001764968],"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.00007740068,0.0001453351,0.001865082,0.00009552539,0.0001451396,0.00002207502,0.0004454828,0.04548059,0.001586174,0.3350514,0.00195783,0.6131279],"study_design_scores_gemma":[0.001935548,0.0004129836,0.03056624,0.00007160665,0.00002635049,0.0001267627,0.00002176595,0.879228,0.0004770694,0.07636782,0.0101424,0.000623431],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0866626,0.0001534983,0.9102457,0.002078994,0.0002854914,0.0002599715,0.00004544394,0.0001292927,0.0001390243],"genre_scores_gemma":[0.6296576,0.000007797455,0.3691484,0.0004565724,0.0001976228,0.00004967587,0.00004988119,0.0000138331,0.0004186243],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8337474,"threshold_uncertainty_score":0.70382,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003684601,0.0002023172,0.0002375481,0.0002367014,0.00009222496,0.00004905572,0.0001518901,0.00007224401,0.0001861961],"category_scores_gemma":[0.00007914964,0.0001951356,0.0001372518,0.0007128295,0.0000304823,0.00008936966,0.000009574639,0.00009910642,0.0001167161],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002761353,"about_ca_system_score_gemma":0.00002385817,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001945404,"about_ca_topic_score_gemma":0.00000207555,"domain_scores_codex":[0.998907,0.0000564477,0.0003012591,0.0002219758,0.0002131661,0.0003002008],"domain_scores_gemma":[0.9992546,0.0002840363,0.00002862108,0.0001585657,0.0001154948,0.0001586942],"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.00005828238,0.00003063323,0.0002114215,0.0001251435,0.0001356156,0.000003226286,0.0004499009,0.753329,0.001131607,0.2428464,0.0005895445,0.001089238],"study_design_scores_gemma":[0.005909638,0.001565011,0.01298297,0.0005471093,0.0002906665,0.0001186202,0.003216153,0.2508648,0.02022001,0.5081375,0.1926757,0.003471852],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4046828,0.0003573341,0.587643,0.00009164475,0.00076981,0.0005773396,0.0001657433,0.0002384402,0.005473933],"genre_scores_gemma":[0.9946287,0.000004170119,0.004601934,0.0001642172,0.00008474007,0.00004039034,0.0001423467,0.00004601537,0.0002875413],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5899459,"threshold_uncertainty_score":0.7957397,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002519842,0.0001710628,0.0002848707,0.0005630005,0.0001137338,0.00004926249,0.0004513509,0.00005747078,0.00001110724],"category_scores_gemma":[0.00004759851,0.0001638952,0.0001197942,0.001227153,0.00007890062,0.0005778644,0.00004145953,0.00007814867,0.000002629682],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002754461,"about_ca_system_score_gemma":0.0001651455,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001218367,"about_ca_topic_score_gemma":0.000002476627,"domain_scores_codex":[0.9983564,0.00004416192,0.0003980366,0.0003689898,0.0006120955,0.0002203379],"domain_scores_gemma":[0.9985271,0.0003854979,0.0003078745,0.0002147762,0.0004707035,0.00009408026],"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.0002923624,0.000326016,0.001512836,0.0001150707,0.0001873222,0.000005073652,0.0007900565,0.1418076,0.001284922,0.8343402,0.0003515565,0.01898699],"study_design_scores_gemma":[0.003906511,0.002770755,0.2136619,0.0002343953,0.0001151866,0.00003444738,0.0002103519,0.3388751,0.008953794,0.4299712,0.0005220644,0.0007442615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3209837,0.00008784315,0.6775479,0.0006528552,0.00007984243,0.0002121162,0.00005164552,0.00003783829,0.0003462422],"genre_scores_gemma":[0.7841117,0.000003113113,0.2154883,0.0001872503,0.00002336915,0.000003583388,0.000152562,0.000006281685,0.00002380712],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4631279,"threshold_uncertainty_score":0.668345,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001058174,0.0001433311,0.0001497876,0.0001668562,0.00008853529,0.00004819686,0.0001257884,0.00006632694,0.0001052042],"category_scores_gemma":[0.000007122787,0.0001477607,0.00008933961,0.0004281311,0.00003894352,0.00009453733,0.00001815298,0.0001067032,0.000192854],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003296553,"about_ca_system_score_gemma":0.00001169446,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002328834,"about_ca_topic_score_gemma":0.00001311625,"domain_scores_codex":[0.9991382,0.00002540191,0.0002372319,0.0001491804,0.0002217993,0.0002281979],"domain_scores_gemma":[0.9996716,0.0001011488,0.00002985904,0.0001025223,0.00004057779,0.00005424663],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","study_design_scores_codex":[0.000009646681,0.00002082539,0.006778987,0.00003690978,0.000041558,0.00000972049,0.00004211647,0.9018204,0.0003375362,0.08547826,0.004145501,0.001278492],"study_design_scores_gemma":[0.001185323,0.00008762038,0.5061827,0.00005269935,0.00004596832,0.00007226856,0.0002205827,0.2723418,0.0007876165,0.193867,0.02417269,0.0009837461],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9066865,0.0002698598,0.05776047,0.00003162568,0.0004861041,0.0001247459,0.00004835179,0.0003678585,0.03422445],"genre_scores_gemma":[0.9986066,9.109444e-7,0.0006513585,0.0000524112,0.0002970498,0.00001264502,0.0001875664,0.00002698878,0.0001644569],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6294787,"threshold_uncertainty_score":0.6025508,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004124945,0.0002802059,0.0003391327,0.0007331921,0.0001846225,0.0001093655,0.0006856067,0.00009326768,0.0001127891],"category_scores_gemma":[0.0001128206,0.0002781015,0.0002027499,0.002369869,0.00008196704,0.0007796745,0.0003757518,0.0001764347,0.00009806072],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007618452,"about_ca_system_score_gemma":0.0002170348,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000164733,"about_ca_topic_score_gemma":0.00000412731,"domain_scores_codex":[0.997271,0.0001216492,0.0006712968,0.0006028103,0.0009693928,0.0003638348],"domain_scores_gemma":[0.998332,0.0003543244,0.0003034544,0.0004117756,0.0003979751,0.0002005059],"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.0001325579,0.0004227756,0.00775465,0.00008718013,0.0002135367,0.00009086523,0.0005614457,0.844601,0.001665445,0.03998468,0.002665265,0.1018206],"study_design_scores_gemma":[0.001462613,0.0005350253,0.1554805,0.000093225,0.00003246415,0.0001412827,0.00007122123,0.8102365,0.001085369,0.02614873,0.004106784,0.0006063641],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3400151,0.0003420688,0.6568164,0.000901814,0.0004237189,0.0002022328,0.00004401125,0.0001139461,0.001140695],"genre_scores_gemma":[0.9439524,0.00003175814,0.05417444,0.0004308507,0.0002455733,0.00001981275,0.0004698477,0.00001761715,0.0006576272],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6039373,"threshold_uncertainty_score":0.9999671,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002166463,0.000196437,0.0001877438,0.0000688225,0.0007261524,0.0001036135,0.0002717956,0.00007052171,0.0006847488],"category_scores_gemma":[0.00009107732,0.0000961204,0.00009460644,0.0002182341,0.0003876936,0.0003595023,0.000122551,0.0001854201,0.0001708207],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007117438,"about_ca_system_score_gemma":0.00009362103,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00020897,"about_ca_topic_score_gemma":0.0000151396,"domain_scores_codex":[0.9984158,0.0001157603,0.0002670847,0.0003335883,0.0005800779,0.0002877256],"domain_scores_gemma":[0.9992701,0.000126881,0.000128539,0.0002009584,0.0001903608,0.00008319796],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","study_design_scores_codex":[0.002880265,0.0008081869,0.02438705,0.0004407761,0.0005851693,0.0006917447,0.03069888,0.5827217,0.2545275,0.04219704,0.03750386,0.02255786],"study_design_scores_gemma":[0.003417322,0.0008349213,0.7313799,0.0002323822,0.0001604805,0.002378893,0.003445011,0.05826028,0.07099709,0.080089,0.04622466,0.002580118],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9888144,0.0004425325,0.007337926,0.001551073,0.000303127,0.000300094,0.00009087816,0.00007218213,0.00108778],"genre_scores_gemma":[0.9973247,0.00001650793,0.001327132,0.0005858708,0.0001502468,0.00002527254,0.00009708542,0.00001636537,0.0004568194],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7069928,"threshold_uncertainty_score":0.7497519,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004785049,0.0002653635,0.0002660372,0.0009309471,0.0001546506,0.0001555942,0.0005869691,0.00008523859,0.0001234184],"category_scores_gemma":[0.00007000923,0.0002792714,0.0001161578,0.002310643,0.00003448353,0.0007516746,0.0002141987,0.0002041702,0.0004452092],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001601197,"about_ca_system_score_gemma":0.0001736141,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003328467,"about_ca_topic_score_gemma":0.00009123905,"domain_scores_codex":[0.9973672,0.00007489089,0.0005222181,0.0006870349,0.0009170509,0.0004315902],"domain_scores_gemma":[0.9988459,0.0002895531,0.0001006558,0.0002962731,0.0002131491,0.0002544841],"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.00002607716,0.0001337246,0.0009248845,0.000007633086,0.00002181247,0.00001095153,0.0001887504,0.9454609,0.0003124757,0.02550106,0.0006948577,0.02671686],"study_design_scores_gemma":[0.001126176,0.0001637279,0.06128664,0.00004584041,0.000007146014,0.00002757059,0.00001139591,0.9179916,0.0008006652,0.01345345,0.00462335,0.0004624578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2733955,0.0001612249,0.7184908,0.006825,0.0002778455,0.0002835451,0.00002694214,0.0001064445,0.0004326506],"genre_scores_gemma":[0.7798781,0.000001596832,0.2176477,0.001845151,0.0002198089,0.00002537231,0.0001144361,0.00001395153,0.0002538359],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5064826,"threshold_uncertainty_score":0.999966,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0001895652,0.0001673514,0.0001345437,0.0002903451,0.0001974576,0.0001927286,0.0001460433,0.00003579828,0.005103373],"category_scores_gemma":[0.00003062106,0.0001630012,0.00005683638,0.000468129,0.00005418152,0.0004866315,0.00006851427,0.00009381822,0.001878473],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001900364,"about_ca_system_score_gemma":0.000008017807,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002635225,"about_ca_topic_score_gemma":0.00001793874,"domain_scores_codex":[0.9988182,0.000007890302,0.0002490557,0.0003274501,0.0003816448,0.0002157121],"domain_scores_gemma":[0.9996946,0.00003677595,0.00003958681,0.0001428651,0.00006434009,0.00002186526],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","study_design_scores_codex":[0.0003729128,0.000431564,0.009652223,0.0005639575,0.0001954839,0.0000234049,0.0003170297,0.3982451,0.00002806656,0.3322888,0.06040795,0.1974735],"study_design_scores_gemma":[0.00158603,0.00005658291,0.328896,0.00007933268,0.00006761342,0.000002929654,0.0004268059,0.2856353,0.000002814913,0.1794063,0.2029686,0.0008716852],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9564932,0.00004748513,0.001906579,0.002681663,0.0002014998,0.0001853958,0.00001155839,0.0001226418,0.03835],"genre_scores_gemma":[0.99145,0.000009664048,0.0004349519,0.005749277,0.000162756,0.0000114947,0.0002175221,0.00001636345,0.001947972],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3192438,"threshold_uncertainty_score":0.9988987,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00003893748,0.000137546,0.0001660854,0.0001774596,0.0000869763,0.0001145701,0.00004370073,0.00004208183,0.00007722843],"category_scores_gemma":[0.00000995853,0.0001131212,0.00002912249,0.0004158007,0.00003255649,0.0002274417,0.000004874142,0.00007570003,0.000004590804],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001529511,"about_ca_system_score_gemma":0.000007518995,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006870678,"about_ca_topic_score_gemma":0.000002260658,"domain_scores_codex":[0.9993612,0.00001283479,0.0001635061,0.0001611109,0.0001718147,0.0001295866],"domain_scores_gemma":[0.999694,0.000046029,0.0000492988,0.00006059211,0.00008927128,0.00006078386],"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.00005093297,0.00001266106,0.00752289,0.00004551471,0.0002016934,0.0000094894,0.0005596303,0.9524124,0.007059561,0.01930198,0.0001165644,0.01270664],"study_design_scores_gemma":[0.0004795089,0.00008146045,0.4546015,0.00003154836,0.00004341764,0.00001925385,0.0001502334,0.541077,0.0009388939,0.002191137,0.0001069339,0.0002791316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9555899,0.0001878604,0.04281022,0.0002714259,0.00005241612,0.0000968502,0.0000150119,0.0001483274,0.0008279894],"genre_scores_gemma":[0.9964693,0.00002635908,0.00280483,0.0001787788,0.00003706173,0.000002720916,0.0004525559,0.00001024111,0.00001821282],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4470786,"threshold_uncertainty_score":0.4612948,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007679174,0.0002171279,0.0002972856,0.0006490106,0.0003155647,0.0001141494,0.000135632,0.00007941179,0.00007814849],"category_scores_gemma":[0.0006572424,0.000177823,0.00009412556,0.001090248,0.0001263984,0.0002058304,0.00005176526,0.0001930293,0.00001664474],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004784625,"about_ca_system_score_gemma":0.00005258886,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005656069,"about_ca_topic_score_gemma":0.00004953582,"domain_scores_codex":[0.9983065,0.00004335296,0.000447375,0.0003274065,0.0005196487,0.0003557493],"domain_scores_gemma":[0.9974967,0.001923474,0.0001669419,0.0001505439,0.0001386566,0.0001237239],"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.0003707353,0.0002191556,0.004395211,0.0003528865,0.0001681999,0.00002424908,0.001185922,0.0005183375,0.00001208158,0.9808946,0.002346513,0.009512055],"study_design_scores_gemma":[0.003247285,0.0004517168,0.05151724,0.0002190341,0.0001049255,0.00006384656,0.004307782,0.002003197,0.0002944358,0.9266484,0.01026088,0.0008812181],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6447008,0.0009250469,0.3077491,0.0010624,0.0004016716,0.0005075805,0.0001844419,0.0002359279,0.04423302],"genre_scores_gemma":[0.9892346,0.0000227027,0.008306799,0.0002508046,0.0002132851,0.00001459796,0.00006659701,0.00002405012,0.001866542],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3445338,"threshold_uncertainty_score":0.725141,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004541245,0.0001897569,0.0002182684,0.0002710985,0.0002238112,0.00006872489,0.0006740898,0.00005992678,0.00007451813],"category_scores_gemma":[0.0001230138,0.0001175317,0.0002118475,0.000826602,0.00009476108,0.0004143981,0.0001987116,0.000066229,0.00006617762],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004512248,"about_ca_system_score_gemma":0.0001420052,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008658999,"about_ca_topic_score_gemma":8.423476e-7,"domain_scores_codex":[0.9982362,0.00006724301,0.0004339789,0.0004188536,0.000536845,0.0003068266],"domain_scores_gemma":[0.9972888,0.001644386,0.0002164512,0.0003421202,0.0004168489,0.00009143404],"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.00004516076,0.0001859809,0.0004240699,0.00002785211,0.0002018806,0.000002457728,0.0001767746,0.05098666,0.001803184,0.04070153,0.004102355,0.9013421],"study_design_scores_gemma":[0.001244734,0.0001746165,0.007716948,0.00002942235,0.00001925353,0.00002028392,0.0000106777,0.9529905,0.001396415,0.02834302,0.007814148,0.0002400252],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01058285,0.0001859938,0.9862086,0.001964848,0.0002829203,0.0003796661,0.0002101553,0.00007519795,0.0001098223],"genre_scores_gemma":[0.745335,0.00001162855,0.2526908,0.0005926878,0.0003577811,0.00007060368,0.0001769519,0.00002140568,0.000743158],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9020038,"threshold_uncertainty_score":0.4792802,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003789381,0.0002181961,0.0002221959,0.0007814507,0.0002250214,0.0002541258,0.0004367732,0.00007463698,0.00004552274],"category_scores_gemma":[0.0001913106,0.0001601818,0.00007907736,0.001886841,0.00008669732,0.0008949401,0.0002982133,0.00008522502,0.00009346255],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004663003,"about_ca_system_score_gemma":0.0001019362,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009520391,"about_ca_topic_score_gemma":0.000001749132,"domain_scores_codex":[0.9981067,0.00008382575,0.0003392273,0.0005873601,0.0005797533,0.0003031516],"domain_scores_gemma":[0.9982851,0.0008563732,0.0001429812,0.0002585121,0.0002680827,0.0001890162],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.00002611515,0.0001204587,0.01485374,0.00005351135,0.0001472203,0.00002408395,0.0002236295,0.0226317,0.001073014,0.4413142,0.002122706,0.5174096],"study_design_scores_gemma":[0.002794826,0.0003802579,0.6055161,0.0001325367,0.00005120225,0.0001813935,0.00005825667,0.1687232,0.001447905,0.1919062,0.02741169,0.001396396],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1810915,0.0006408907,0.8145497,0.002659479,0.0003330125,0.0001229455,0.00002292016,0.0001499162,0.0004295864],"genre_scores_gemma":[0.9378421,0.0000435062,0.06098834,0.0003103687,0.0002407824,0.00001405211,0.00004238675,0.0000124895,0.0005060238],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7567506,"threshold_uncertainty_score":0.6532023,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004912458,0.0001745427,0.0002016326,0.0001486021,0.0004674845,0.0001373227,0.000696041,0.00004727895,0.0000535671],"category_scores_gemma":[0.0005070472,0.000139859,0.0001920256,0.0009971248,0.0001066773,0.0003901752,0.0001600629,0.0001136944,0.00001975695],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000298692,"about_ca_system_score_gemma":0.00006108386,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004873062,"about_ca_topic_score_gemma":0.00000128487,"domain_scores_codex":[0.9981372,0.0000709609,0.0004784441,0.000365252,0.0006449438,0.0003032231],"domain_scores_gemma":[0.9962946,0.002684798,0.0002491405,0.0002859812,0.0003911931,0.0000942804],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005370598,0.0002670009,0.001505074,0.0002757038,0.0002632139,0.000004503369,0.0005982632,0.2743934,0.0004886386,0.5522196,0.03168896,0.138242],"study_design_scores_gemma":[0.0007078263,0.0001883297,0.02498761,0.0001045095,0.00002337147,0.00002439583,0.00004024639,0.9172776,0.000430867,0.04463964,0.01124274,0.000332819],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0164325,0.004724623,0.9720744,0.004706812,0.0005518018,0.0003645909,0.0000512984,0.00008238095,0.00101163],"genre_scores_gemma":[0.9382375,0.0001074,0.05982198,0.0006760933,0.0001904085,0.00004987338,0.00006412986,0.00001308827,0.0008394503],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9218051,"threshold_uncertainty_score":0.5703286,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00116866,0.0001533263,0.000169646,0.0002092566,0.0003202621,0.0001530846,0.0008621722,0.00004517558,0.00001638424],"category_scores_gemma":[0.0002068614,0.00009849067,0.00008363545,0.001524051,0.0002339045,0.0002275552,0.00007912269,0.0001940096,0.00002581145],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002961765,"about_ca_system_score_gemma":0.000137946,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002579556,"about_ca_topic_score_gemma":0.00004520747,"domain_scores_codex":[0.9979188,0.0003539609,0.0004383328,0.0002971543,0.0007236664,0.0002680186],"domain_scores_gemma":[0.9980152,0.001255235,0.0001677774,0.0003656802,0.0001455486,0.00005056833],"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.00001166441,0.00007826786,0.00254115,0.00001013228,0.00002058884,0.000006639508,0.0003344251,0.08783851,0.00003562375,0.9022554,0.0005515143,0.006316063],"study_design_scores_gemma":[0.001157545,0.0002084498,0.3961146,0.00002892119,0.00001448774,0.000222596,0.000444549,0.1775754,0.0004526543,0.4055444,0.01781071,0.000425734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1982862,0.001042483,0.786169,0.003139937,0.0006079333,0.0004627089,0.00002919547,0.00005950064,0.01020307],"genre_scores_gemma":[0.9787074,0.00001359047,0.02062601,0.0004316596,0.00004613607,0.00001611227,0.00008510997,0.000005750623,0.00006818264],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7804213,"threshold_uncertainty_score":0.4016333,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000928362,0.0002208052,0.0002327023,0.0006988472,0.0002415198,0.0002348741,0.0003806197,0.00007108398,0.00003257342],"category_scores_gemma":[0.0001753354,0.0002272838,0.00006598316,0.002044858,0.00007899831,0.0007530706,0.0003544475,0.0001794834,0.00002631064],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001016952,"about_ca_system_score_gemma":0.00009159709,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007505805,"about_ca_topic_score_gemma":0.0001337384,"domain_scores_codex":[0.9977421,0.00008128108,0.0004139517,0.0006835742,0.0006898204,0.000389333],"domain_scores_gemma":[0.9986112,0.000524906,0.0001191059,0.0002903976,0.0002124522,0.0002420066],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","study_design_scores_codex":[0.0001540816,0.0003954359,0.0718216,0.00007782115,0.00008722465,0.00006163366,0.001846098,0.511542,0.0006483193,0.3321829,0.003447768,0.07773512],"study_design_scores_gemma":[0.0005756585,0.000106862,0.8236563,0.00005482793,0.000007848594,0.00004636207,0.0001692854,0.1344117,0.0003920494,0.03363451,0.006499448,0.0004451894],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.440963,0.0003558967,0.5552725,0.002355295,0.0003018118,0.0002084044,0.00001726577,0.00006952327,0.0004564023],"genre_scores_gemma":[0.915013,0.000007745765,0.08372393,0.0004388103,0.0001421208,0.00001690376,0.00009547238,0.00001081333,0.0005511891],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7518346,"threshold_uncertainty_score":0.9268364,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001921281,0.0002812107,0.0004915626,0.0001823003,0.0002827414,0.00003515482,0.0002856393,0.000126618,0.00007867982],"category_scores_gemma":[0.001288708,0.0002596337,0.0002131309,0.0003866782,0.0001326205,0.0001497475,0.00008724516,0.0001789931,0.00003952887],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000070011,"about_ca_system_score_gemma":0.00009918311,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003648514,"about_ca_topic_score_gemma":0.00000108734,"domain_scores_codex":[0.9982458,0.00004138127,0.0005023445,0.0003515243,0.0004868253,0.0003721404],"domain_scores_gemma":[0.9964259,0.002601595,0.0002752331,0.000292866,0.0002813807,0.0001230787],"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.00008170693,0.0002135572,0.0008218702,0.0002254111,0.0001595819,0.00002884679,0.0006434431,0.00166206,0.00006227988,0.9858877,0.00930277,0.0009107885],"study_design_scores_gemma":[0.001802396,0.000206126,0.0008466477,0.00005939722,0.00005479963,0.0001460073,0.0001785817,0.005754784,0.0002328419,0.9851046,0.005184106,0.0004297792],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3643614,0.0001860725,0.6319524,0.0003167922,0.000578838,0.0008562023,0.0001375503,0.0002687016,0.001342045],"genre_scores_gemma":[0.7693091,0.000003757468,0.2290944,0.0001786809,0.0002739165,0.00007897148,0.00008123349,0.00006254898,0.0009173187],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4049478,"threshold_uncertainty_score":0.9999856,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003397706,0.0001510659,0.0004217245,0.000193426,0.0000500356,0.00001451826,0.0001617337,0.00007591092,0.00002087404],"category_scores_gemma":[0.00241963,0.000147033,0.00006165563,0.0006573091,0.0001594671,0.0001299681,0.0001152899,0.00009271428,0.000003654232],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004225485,"about_ca_system_score_gemma":0.000109344,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002225683,"about_ca_topic_score_gemma":0.000005568721,"domain_scores_codex":[0.9985856,0.00007525607,0.0005462173,0.0001795282,0.0004590428,0.0001543211],"domain_scores_gemma":[0.9973184,0.001121001,0.000426687,0.0002094279,0.0008160447,0.0001084089],"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.00007164582,0.000408077,0.0100468,0.0004242864,0.0001686611,0.000002336856,0.002447804,0.003998358,0.0003334038,0.9807888,0.0008916046,0.0004182819],"study_design_scores_gemma":[0.001658902,0.0001577691,0.004667202,0.0001080668,0.00007238158,0.000007376457,0.0007333983,0.02323873,0.0003375079,0.968701,0.0001081196,0.0002095671],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7065804,0.0002186725,0.2913701,0.00009008819,0.0002550161,0.0003495037,0.0001191264,0.00007029578,0.0009468545],"genre_scores_gemma":[0.8505689,0.00000596102,0.1492147,0.0000126281,0.0000276347,0.00000469587,0.00006085617,0.00002500187,0.00007966248],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1439885,"threshold_uncertainty_score":0.5995833,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000331862,0.0002661483,0.000261866,0.0005634725,0.0004005538,0.000320326,0.0005902108,0.00008549581,0.0000356151],"category_scores_gemma":[0.00003757971,0.0002480211,0.0001097967,0.002548359,0.00002994422,0.0005212692,0.00007763031,0.0001269577,0.00006390223],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009082623,"about_ca_system_score_gemma":0.0001744157,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004713599,"about_ca_topic_score_gemma":0.00000160937,"domain_scores_codex":[0.9978412,0.00004907371,0.0004071158,0.0007069008,0.0005922905,0.0004034626],"domain_scores_gemma":[0.9984358,0.0003146963,0.0001540858,0.000362558,0.0004884931,0.0002443507],"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.00006826661,0.000123906,0.0001481485,0.00001600524,0.00006239949,0.000003809572,0.000142134,0.7248722,0.000667265,0.211974,0.00145698,0.06046487],"study_design_scores_gemma":[0.004853073,0.00171092,0.1127087,0.000110573,0.0001023928,0.00008698233,0.00006822462,0.6475806,0.002172842,0.09857552,0.1300059,0.00202435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02551192,0.0002193766,0.9684699,0.003252099,0.0002068394,0.001008632,0.00004077598,0.000262346,0.001028086],"genre_scores_gemma":[0.6670189,0.000001651122,0.3303736,0.001418399,0.0002085626,0.0001257889,0.0002602313,0.00001383307,0.0005790291],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.641507,"threshold_uncertainty_score":0.9999972,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002438867,0.0001549774,0.0001858306,0.00003941893,0.0004540113,0.0001139916,0.0002800861,0.00006392962,0.00005524511],"category_scores_gemma":[0.0003148132,0.0001034766,0.0001484537,0.0002955079,0.000100615,0.00004946872,0.00006189523,0.0001160141,0.00003848782],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004246957,"about_ca_system_score_gemma":0.00008276172,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007189395,"about_ca_topic_score_gemma":0.000008632987,"domain_scores_codex":[0.9988942,0.00001686443,0.0003253262,0.0002133082,0.0003043108,0.0002460422],"domain_scores_gemma":[0.997929,0.001471246,0.0001408216,0.0002521402,0.0001267452,0.00008005129],"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.00001388044,0.00009529747,0.00004946376,0.00006150777,0.00007161166,8.936946e-7,0.0002073323,0.005402844,0.00004370216,0.9837234,0.008636406,0.001693671],"study_design_scores_gemma":[0.0005487555,0.00004514512,0.0005193363,0.00002161297,0.00003068824,0.00001341844,0.0002072887,0.004241948,0.0001097376,0.9741628,0.01993075,0.0001685173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07580297,0.0001806812,0.9128132,0.007148896,0.0001253984,0.0008677697,0.0001188133,0.0001226578,0.002819646],"genre_scores_gemma":[0.7694578,0.000005594718,0.2288326,0.0002744941,0.0002175165,0.0001895802,0.00007894418,0.00003740445,0.0009060898],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6936548,"threshold_uncertainty_score":0.4219655,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002091179,0.0001753954,0.0002939269,0.000363176,0.0001043844,0.00002303204,0.0003897632,0.00005645229,0.00006486307],"category_scores_gemma":[0.00004673025,0.0001611343,0.0001183119,0.001599735,0.0001553685,0.0004359826,0.0001077916,0.0001081036,0.000019844],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003124532,"about_ca_system_score_gemma":0.0002541782,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001915159,"about_ca_topic_score_gemma":0.00000148954,"domain_scores_codex":[0.9981338,0.00007321648,0.0004490609,0.0003539409,0.0007782718,0.0002117053],"domain_scores_gemma":[0.9985867,0.0003209716,0.0002981573,0.0002478604,0.0004459471,0.0001003657],"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.0004921437,0.0007828696,0.0682966,0.000517045,0.0007059278,0.0001606311,0.01309323,0.6588073,0.001836294,0.238464,0.001941453,0.01490249],"study_design_scores_gemma":[0.004501662,0.0008675831,0.3807114,0.0002823829,0.00007667411,0.001485513,0.0004228471,0.5579115,0.006277516,0.04504163,0.001316487,0.001104884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5233951,0.00004883065,0.4752609,0.0001813975,0.00008179196,0.00009420801,0.00002508141,0.00002839463,0.000884313],"genre_scores_gemma":[0.8414412,0.000005079081,0.1582186,0.00009591507,0.00005142831,0.00000387138,0.00008657408,0.000009096873,0.00008831836],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.318046,"threshold_uncertainty_score":0.6570864,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004688524,0.0002241462,0.0001726973,0.0002604042,0.000804659,0.000504782,0.0009547102,0.00006224497,0.00001862976],"category_scores_gemma":[0.00009684506,0.000176448,0.0001373113,0.001702987,0.00007989081,0.0005523153,0.0001038374,0.0002059327,0.0001133501],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005251088,"about_ca_system_score_gemma":0.0001222143,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000468392,"about_ca_topic_score_gemma":0.00000386944,"domain_scores_codex":[0.9977806,0.00009423598,0.0004142747,0.000498491,0.0008113455,0.0004010393],"domain_scores_gemma":[0.9984503,0.000553248,0.0001690781,0.0004259975,0.0002510689,0.0001502917],"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.00002445633,0.00006295851,0.00021364,0.000004783371,0.00003271207,0.00001329064,0.0001243786,0.1403896,0.0000665748,0.7609702,0.005626597,0.09247076],"study_design_scores_gemma":[0.0007592454,0.0002738529,0.1114957,0.000026112,0.00001309329,0.00008852029,0.00004571756,0.3186451,0.0002416865,0.5156729,0.05214738,0.0005906645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01467057,0.001167567,0.974384,0.005301312,0.0006170365,0.0001939573,0.00001530807,0.0002179826,0.003432281],"genre_scores_gemma":[0.962265,0.00003821137,0.03504094,0.001617634,0.0002373689,0.00001208656,0.0001453442,0.000008430885,0.000635041],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9475944,"threshold_uncertainty_score":0.719534,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004913879,0.0002025354,0.000294994,0.0003995486,0.0001641839,0.00006486836,0.0008171666,0.00005976779,0.0000935115],"category_scores_gemma":[0.0001640324,0.0001551547,0.0001858828,0.001446952,0.0001905956,0.0002776305,0.0001169247,0.0001579763,0.00002354384],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003149433,"about_ca_system_score_gemma":0.0001197456,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001628659,"about_ca_topic_score_gemma":0.000001451432,"domain_scores_codex":[0.997856,0.0001371239,0.0005449484,0.0003678293,0.0008588237,0.0002352601],"domain_scores_gemma":[0.9979857,0.000828628,0.0003409657,0.0004265508,0.0003363643,0.00008180532],"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.00003685503,0.000153564,0.0002230786,0.00001583997,0.00004213667,0.000002378953,0.0002104923,0.1046286,0.0009060423,0.8774599,0.000875958,0.01544516],"study_design_scores_gemma":[0.0005435193,0.0005624327,0.1599198,0.00006022058,0.00001503975,0.00001610234,0.00004862061,0.1856198,0.007266481,0.6453695,0.0002890598,0.0002894309],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3756066,0.0001574613,0.6173787,0.003329368,0.0002085733,0.0002253017,0.00004146365,0.00005017851,0.003002304],"genre_scores_gemma":[0.9722078,0.00000415223,0.02667417,0.0008802479,0.0000650642,0.000004266724,0.00008047762,0.000006558402,0.00007729884],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5966011,"threshold_uncertainty_score":0.6327024,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}