{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":246,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":246,"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":"ad4f33e5fcfd","filters":{"venue":"Discrete Mathematics & Theoretical Computer Science"}},"results":[{"id":"W2143668983","doi":"10.46298/dmtcs.317","title":"On Linear Layouts of Graphs","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":116,"is_retracted":false,"has_abstract":true,"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":"Combinatorics; Mathematics; Partition (number theory); Disjoint sets; Discrete mathematics; Mathematical proof","retraction":null,"screen_n_in":null,"score":{"opus":0.00802119738390963,"gpt":0.2237613964525075,"spread":0.2157401990685979,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005132013,0.0001779871,0.0002544301,0.0001602751,0.0001027819,0.00004850346,0.0006467925,0.00005109513,0.0000341561],"category_scores_gemma":[0.00004482743,0.0001356032,0.0001040239,0.0005798976,0.001416796,0.0001086365,0.00008694777,0.0001426399,0.00006019406],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001957819,"about_ca_system_score_gemma":0.0000175221,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.882962e-7,"about_ca_topic_score_gemma":1.408786e-7,"domain_scores_codex":[0.9986316,0.00001978468,0.0003299182,0.0002237024,0.0004645702,0.0003304276],"domain_scores_gemma":[0.9991177,0.00013654,0.00004416515,0.0004975153,0.00006029474,0.0001437955],"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.000003285995,0.00004252091,0.000002652775,0.00008337264,0.000008623246,0.000003330008,0.001229384,0.01129963,0.001447271,0.9857106,0.000004681467,0.0001647102],"study_design_scores_gemma":[0.0001877943,0.0001094524,0.00001578165,0.0001853601,0.000008456031,0.00001162988,0.00006656185,0.1554078,0.01389834,0.8299422,0.000004582892,0.0001620048],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4399654,0.00002566502,0.546449,0.00003688031,0.0003703727,0.0001657529,0.000007179059,0.0001878217,0.01279195],"genre_scores_gemma":[0.969673,0.000002274788,0.03023475,0.00003481431,0.00002830246,0.000005121653,8.838245e-7,0.00001867655,0.00000212057],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5297077,"threshold_uncertainty_score":0.5529737,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2156308991","doi":"10.46298/dmtcs.346","title":"Stacks, Queues and Tracks: Layouts of Graph Subdivisions","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":78,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Ministerio de Economía y Competitividad","keywords":"Combinatorics; Subdivision; Vertex (graph theory); Queue; Mathematics; Bounded function; Graph; Discrete mathematics; Planar graph; Computer science; Geography","retraction":null,"screen_n_in":null,"score":{"opus":0.01169885412521341,"gpt":0.267115975801654,"spread":0.2554171216764406,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000940285,0.0001836064,0.0002550301,0.0002819202,0.0002870877,0.0003257326,0.001107715,0.00004596684,0.00002572078],"category_scores_gemma":[0.0001184175,0.0001466538,0.00007447212,0.001039153,0.001328642,0.0007826084,0.0006292932,0.0001218876,0.00001528472],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001991035,"about_ca_system_score_gemma":0.00009617172,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001302197,"about_ca_topic_score_gemma":0.000001171561,"domain_scores_codex":[0.997902,0.00005860818,0.0004446252,0.0005031329,0.000744554,0.0003470191],"domain_scores_gemma":[0.9984488,0.0003751672,0.000136696,0.0005603219,0.0002548356,0.0002241607],"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.000001806271,0.00008768157,0.00001601695,0.00002299674,0.000005718937,0.000001229722,0.001847593,0.0008591644,0.0009020118,0.9779512,0.00003280392,0.01827175],"study_design_scores_gemma":[0.0001456311,0.0001086726,0.0002836942,0.0000424071,0.000007504294,0.00002324798,0.00003834966,0.713289,0.004891853,0.2809325,0.000073349,0.0001637442],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08440734,0.000137934,0.9128895,0.0008481061,0.000135374,0.000157644,0.000005066432,0.00008383332,0.001335177],"genre_scores_gemma":[0.6177095,0.00001176912,0.3821017,0.0001101949,0.00004982468,0.000003225096,0.000001368253,0.000004576496,0.000007841006],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7124299,"threshold_uncertainty_score":0.5980369,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2135716534","doi":"10.46298/dmtcs.532","title":"On the metric dimension of Grassmann graphs","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"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; Combinatorics; Linear subspace; Vertex (graph theory); Metric dimension; Dimension (graph theory); Graph; Subspace topology; Metric (unit); Grassmannian; Discrete mathematics; Pure mathematics; Pathwidth; Line graph","retraction":null,"screen_n_in":null,"score":{"opus":0.01632379254665654,"gpt":0.2504834117644909,"spread":0.2341596192178344,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003854329,0.0002501023,0.0003056233,0.0004159646,0.0004726486,0.0002156907,0.002438671,0.00005826936,0.0000274123],"category_scores_gemma":[0.0004061882,0.000138603,0.0001625439,0.002802943,0.002311803,0.0004580448,0.001010774,0.0002363072,0.00008301363],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001870463,"about_ca_system_score_gemma":0.00004347796,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001707385,"about_ca_topic_score_gemma":5.086089e-8,"domain_scores_codex":[0.9968661,0.0001430464,0.0004950776,0.0004609268,0.00131654,0.0007183183],"domain_scores_gemma":[0.9964482,0.001296309,0.0002172034,0.001502355,0.0002350729,0.0003009],"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.000002001417,0.0001708968,0.00004927981,0.00001588871,0.00000816542,8.070961e-7,0.0009174141,0.00007292807,0.0008824537,0.9969203,0.0001271971,0.0008327051],"study_design_scores_gemma":[0.0000963752,0.0001223383,0.0001043956,0.00006523843,0.00001073957,0.00001258548,0.00002922019,0.2637992,0.006276274,0.7293163,0.000007169629,0.0001601469],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1713472,0.00009829734,0.8226206,0.001048086,0.0006439723,0.0002745003,0.000001638509,0.0001402747,0.003825415],"genre_scores_gemma":[0.8503352,0.000004462734,0.1491932,0.0004324976,0.00001094338,0.000008300214,4.20384e-7,0.00001012034,0.000004773696],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6789881,"threshold_uncertainty_score":0.8517933,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1549363509","doi":"10.46298/dmtcs.315","title":"Track Layouts of Graphs","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; European Commission; Univerzita Karlova v Praze","keywords":"Combinatorics; Bounded function; Vertex (graph theory); Mathematics; Planar graph; Queue; Graph; Discrete mathematics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01272207350378279,"gpt":0.2595346679209667,"spread":0.246812594417184,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008256867,0.0001852017,0.0002541507,0.0002871695,0.000243135,0.0002542956,0.001766043,0.00004758443,0.00002097901],"category_scores_gemma":[0.0001068866,0.0001505037,0.0001194086,0.001686923,0.001302372,0.000637512,0.0005273754,0.0001256194,0.00003804627],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000328102,"about_ca_system_score_gemma":0.0001782308,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001549008,"about_ca_topic_score_gemma":3.692994e-7,"domain_scores_codex":[0.9976819,0.00003556659,0.0004593194,0.0005089304,0.0009305219,0.0003837534],"domain_scores_gemma":[0.9984561,0.0001783633,0.0001531607,0.0007169276,0.0002931537,0.0002023278],"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.000001791855,0.00011481,0.000005274077,0.00002428207,0.000005449457,0.000003810727,0.001449134,0.004050876,0.00147499,0.989444,0.000007331132,0.003418269],"study_design_scores_gemma":[0.0002248011,0.0001148861,0.0001265174,0.00004529119,0.000005699639,0.00003117225,0.00002039733,0.277247,0.01417246,0.7078428,0.00001230497,0.0001566781],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05600641,0.00003536908,0.9400747,0.0005525274,0.0003186243,0.0001689929,0.000002615542,0.0001081873,0.002732611],"genre_scores_gemma":[0.5839054,0.000002145344,0.4159458,0.0001062431,0.00002782373,0.00000340428,0.000001193471,0.000004546798,0.000003468367],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.527899,"threshold_uncertainty_score":0.6137361,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2114920334","doi":"10.46298/dmtcs.282","title":"Sums of Digits, Overlaps, and Palindromes","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"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; Palindrome; Combinatorics; Word (group theory); Base (topology); Symbol (formal); Arithmetic; Discrete mathematics; Mathematical analysis; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.007898847532994717,"gpt":0.2346354895262134,"spread":0.2267366419932187,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001142553,0.0002329636,0.0003692225,0.0001328452,0.0002288333,0.000461991,0.001994589,0.00005741025,0.0001793496],"category_scores_gemma":[0.00006309705,0.0001737562,0.00008589435,0.0007232002,0.002716372,0.000716112,0.00072543,0.0001329871,0.00004061659],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001425218,"about_ca_system_score_gemma":0.00005742303,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002284074,"about_ca_topic_score_gemma":1.607533e-7,"domain_scores_codex":[0.9976628,0.00005618397,0.0004562234,0.0006034436,0.0007227789,0.0004985996],"domain_scores_gemma":[0.9981664,0.0003867897,0.00010941,0.001004763,0.00008560355,0.00024706],"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.000002452787,0.00004775374,0.00002830031,0.00003794998,0.000006621374,0.000006377419,0.001075496,0.00001111296,0.0004270931,0.954793,0.00001872098,0.04354508],"study_design_scores_gemma":[0.0001761396,0.0001274778,0.0003318088,0.00009848271,0.000007667528,0.00007165282,0.0000288423,0.4661273,0.003096158,0.5296078,0.00009603029,0.000230683],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2600061,0.0001025901,0.730131,0.000377021,0.0001336179,0.0001769359,0.000006767503,0.0001640402,0.008901941],"genre_scores_gemma":[0.8017076,0.0000287772,0.1980265,0.0001625444,0.00002975904,0.000003770788,8.48999e-7,0.000009800598,0.00003045569],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5417015,"threshold_uncertainty_score":0.9999977,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1502166895","doi":"10.46298/dmtcs.387","title":"Complexity results on graphs with few cliques","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"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":"Combinatorics; Mathematics; Chordal graph; Split graph; Discrete mathematics; Clique graph; Vertex cover; Clique-sum; Indifference graph; Cograph; Vertex (graph theory); Clique problem; Block graph; Time complexity; Treewidth; Pathwidth; Graph; 1-planar graph; Line graph; Graph power","retraction":null,"screen_n_in":null,"score":{"opus":0.03449243138924327,"gpt":0.3270042868670117,"spread":0.2925118554777685,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.006431139,0.000431453,0.0004540375,0.0005878769,0.0008102832,0.0007153961,0.004576282,0.00008494392,0.00001879249],"category_scores_gemma":[0.0003475788,0.0002946996,0.0001339947,0.002814007,0.008238183,0.0008272029,0.001344971,0.0005611336,0.0001007585],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008940708,"about_ca_system_score_gemma":0.0001273784,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000234398,"about_ca_topic_score_gemma":0.000004517711,"domain_scores_codex":[0.9942607,0.0001557091,0.0006922663,0.001318317,0.00215549,0.001417537],"domain_scores_gemma":[0.9948223,0.001533684,0.0002243207,0.002294547,0.0004564201,0.0006686974],"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.0001179901,0.0001723548,0.0000170814,0.00002383623,0.0000108079,0.00006436227,0.00106489,0.00005209654,0.0002190023,0.9929848,0.00002905834,0.00524367],"study_design_scores_gemma":[0.0005021701,0.0009561367,0.000357913,0.0001437099,0.000005442449,0.00007182058,0.00005589581,0.1278057,0.006497819,0.8631148,0.00006424906,0.0004242595],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02299096,0.00001063933,0.9477398,0.0009867678,0.0001811364,0.0004550629,0.000008461638,0.0004228753,0.02720426],"genre_scores_gemma":[0.5590756,0.000002596575,0.4405286,0.0003153126,0.00003817554,0.000006193249,0.000001677943,0.00001676105,0.0000150558],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5360847,"threshold_uncertainty_score":0.9999505,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2104176064","doi":"10.46298/dmtcs.427","title":"On-line Ramsey numbers for paths and stars","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":34,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Statistics Canada; Dalhousie University","funders":"","keywords":"Combinatorics; Ramsey's theorem; Clique; Joins; Monochromatic color; Graph; Mathematics; Enhanced Data Rates for GSM Evolution; Upper and lower bounds; Line (geometry); Discrete mathematics; Computer science; Physics; Geometry; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.03021904081685214,"gpt":0.2993518997009093,"spread":0.2691328588840571,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001366528,0.0003244371,0.0004515974,0.0001458894,0.001098199,0.0001188299,0.0007956492,0.00009653907,0.0000628112],"category_scores_gemma":[0.00088885,0.0002261511,0.0001473417,0.0003308595,0.004677358,0.0001610235,0.0004737367,0.000222801,0.000006260239],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002899228,"about_ca_system_score_gemma":0.00005165622,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.480509e-7,"about_ca_topic_score_gemma":2.833864e-7,"domain_scores_codex":[0.9975644,0.00005759543,0.000477544,0.0005976062,0.0006923695,0.0006105072],"domain_scores_gemma":[0.9964436,0.002194925,0.000148149,0.0007475872,0.0001702083,0.0002955224],"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.00003168263,0.00008379113,0.00001232581,0.00009649176,0.00001731551,0.000009055257,0.003350008,0.00001363654,0.00007661118,0.9953329,0.0002844558,0.0006917146],"study_design_scores_gemma":[0.0004388351,0.0003495461,0.00002109407,0.00007820311,0.00002680047,0.00008782714,0.00008541519,0.10295,0.0006518431,0.8949773,0.00004172072,0.0002914593],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4091559,0.00001427632,0.5860907,0.0001852062,0.0002914699,0.0004858911,0.00002316068,0.0001053443,0.003647966],"genre_scores_gemma":[0.706103,0.000009135956,0.2934283,0.0002927408,0.00008411267,0.0000190865,0.000001630955,0.00002878816,0.00003311194],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.2969471,"threshold_uncertainty_score":0.9980313,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1532852577","doi":"10.46298/dmtcs.482","title":"On edge-intersection graphs of k-bend paths in grids","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"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":"Combinatorics; Mathematics; Pathwidth; 1-planar graph; Indifference graph; Chordal graph; Planar graph; Outerplanar graph; Longest path problem; Discrete mathematics; Grid; Clique-sum; Lattice graph; Line graph; Graph; Voltage graph; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01211023971228042,"gpt":0.2889517041416278,"spread":0.2768414644293474,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.002723555,0.0002692772,0.000369942,0.0007809208,0.0002096465,0.0002422988,0.00327377,0.0000944437,0.00005834557],"category_scores_gemma":[0.0004762653,0.000212765,0.0001407981,0.002288467,0.003553834,0.0006653706,0.001047341,0.0006941771,0.00004010502],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003879797,"about_ca_system_score_gemma":0.0001021176,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002765224,"about_ca_topic_score_gemma":0.000005365926,"domain_scores_codex":[0.9966176,0.0001184016,0.0005667405,0.0008081004,0.001165496,0.0007237158],"domain_scores_gemma":[0.9969517,0.0008517355,0.0001613103,0.001527904,0.0002370322,0.0002703431],"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.00001297708,0.0001824083,0.00005051714,0.00003116683,0.000003793442,0.00001133221,0.001189235,0.00008939843,0.009273616,0.9840255,0.000007455507,0.005122632],"study_design_scores_gemma":[0.0002003581,0.0002510778,0.0001888626,0.000069421,0.000001890662,0.00002116293,0.00003312339,0.3039213,0.01154626,0.6835895,0.000004272826,0.0001727795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2878269,0.000003778567,0.706123,0.0001653504,0.0005846893,0.0002486719,0.000002715363,0.0000802463,0.004964645],"genre_scores_gemma":[0.8116301,0.0000018368,0.1882358,0.00006917187,0.00002864726,0.00001440477,6.059317e-7,0.00001331019,0.000006090165],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5238032,"threshold_uncertainty_score":0.9991579,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W205074548","doi":"10.46298/dmtcs.3342","title":"Random Infinite Permutations and the Cyclic Time Random Walk","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":30,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Random walk; Combinatorics; Mathematics; Vertex (graph theory); Random graph; Random regular graph; Heterogeneous random walk in one dimension; Discrete mathematics; Graph; Statistics; Line graph; 1-planar graph","retraction":null,"screen_n_in":null,"score":{"opus":0.01415781025183799,"gpt":0.2782584065970568,"spread":0.2641005963452188,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00356529,0.0003100829,0.0006156702,0.0001032447,0.0007609923,0.0004452936,0.0006840096,0.00007354798,0.0002649798],"category_scores_gemma":[0.007953885,0.0001778672,0.0001294748,0.0005945403,0.004293794,0.0001636115,0.0002809321,0.0002762585,0.00008348203],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002282092,"about_ca_system_score_gemma":0.00009483844,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.158262e-7,"about_ca_topic_score_gemma":3.995795e-7,"domain_scores_codex":[0.9972559,0.0002254294,0.0006403602,0.0004896625,0.0008105787,0.0005780741],"domain_scores_gemma":[0.9898586,0.008847468,0.0001760203,0.0006173009,0.0002259053,0.0002746866],"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.00006524615,0.00005804394,5.539484e-7,0.00006917706,0.00002070202,0.000004300417,0.001935504,0.0000108889,0.00006594532,0.9972221,0.00004299257,0.0005045905],"study_design_scores_gemma":[0.002460723,0.00004921581,0.000001239996,0.00005838088,0.00008091656,0.00006933034,0.00009707775,0.3579671,0.0001158039,0.6389082,0.00002292035,0.0001690465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005711886,0.00006006222,0.9807107,0.0005810127,0.0001524778,0.0006855087,0.00001396298,0.00009471073,0.0119897],"genre_scores_gemma":[0.6912007,0.00001555044,0.3083101,0.0002727118,0.00004847869,0.00005717944,0.000001519524,0.00002874774,0.00006502135],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6854888,"threshold_uncertainty_score":0.9984159,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2048900104","doi":"10.46298/dmtcs.3401","title":"An upper bound for the chromatic number of line graphs","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Combinatorics; Multigraph; Mathematics; Line graph; Discrete mathematics; Graph; Bounded function; Upper and lower bounds; Chromatic polynomial; Chromatic scale; Clique number; Perfect graph; Friendship graph; Bound graph; Critical graph; Graph power","retraction":null,"screen_n_in":null,"score":{"opus":0.01896803141561163,"gpt":0.3320315070692292,"spread":0.3130634756536176,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.003407183,0.0002901387,0.0003888022,0.000190217,0.0006969693,0.000550204,0.00553726,0.00006539706,0.00008151851],"category_scores_gemma":[0.0002773725,0.0001810105,0.0002101276,0.001422858,0.005055673,0.001159762,0.0008750183,0.000238373,0.00004790722],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000402164,"about_ca_system_score_gemma":0.0001307023,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001023394,"about_ca_topic_score_gemma":8.967056e-7,"domain_scores_codex":[0.9964992,0.0001192215,0.000630231,0.0007160011,0.001199844,0.0008354533],"domain_scores_gemma":[0.9951264,0.001751466,0.0002022432,0.002172666,0.0004424487,0.0003047504],"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.000009021808,0.0001658905,0.00002241928,0.00005164837,0.00001491317,9.34207e-7,0.001574793,0.0004056033,0.001023346,0.9847762,0.0000176489,0.01193758],"study_design_scores_gemma":[0.0001604766,0.0001156637,0.00003414716,0.00003218006,0.000009304345,0.00002416236,0.00003799358,0.5109921,0.00291626,0.4854975,0.00004095479,0.0001392939],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04025615,0.00004687562,0.9565977,0.001245958,0.0001760244,0.0006643443,0.000008355222,0.0001248378,0.0008797751],"genre_scores_gemma":[0.5466151,0.00000512058,0.4530866,0.0001640852,0.00006632247,0.0000364615,8.799791e-7,0.00001458149,0.00001083589],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5105865,"threshold_uncertainty_score":0.9998432,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2160494352","doi":"10.46298/dmtcs.353","title":"Connectedness of number theoretical tilings","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Mathematical Dynamics and Fractals","field":"Mathematics","cited_by":29,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"Japan Society for the Promotion of Science","keywords":"Social connectedness; Mathematics; Degree (music); Combinatorics; Discrete mathematics; Matrix (chemical analysis); Affine transformation; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01625733296930064,"gpt":0.3013194107869862,"spread":0.2850620778176856,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.003001746,0.0004587505,0.0009112576,0.0001672431,0.0002783013,0.000215097,0.001647438,0.0001767064,0.002698497],"category_scores_gemma":[0.001757048,0.0003369653,0.000293227,0.0008368942,0.007704386,0.0003377489,0.0007760641,0.0003840759,0.0002125756],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005771647,"about_ca_system_score_gemma":0.0001083976,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.443239e-7,"about_ca_topic_score_gemma":5.971252e-7,"domain_scores_codex":[0.995524,0.000108885,0.001283603,0.0007105605,0.001473498,0.0008994227],"domain_scores_gemma":[0.9949439,0.002460602,0.0003813382,0.001255454,0.0004977617,0.0004609792],"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.00001473764,0.0004745713,0.00001629434,0.0002514365,0.0000261132,0.00000499281,0.001415787,0.000009495683,0.0006714088,0.994862,0.00007920109,0.002173982],"study_design_scores_gemma":[0.0002377862,0.0000660425,0.000007848338,0.0001608208,0.0000469599,0.00004777356,0.00007416443,0.3624915,0.002588819,0.6339532,0.0000415946,0.0002835803],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2054767,0.00001188475,0.7401799,0.0007208194,0.0001751269,0.0004787858,0.00002209264,0.0001803348,0.05275439],"genre_scores_gemma":[0.6421705,0.000004484426,0.357504,0.0001185582,0.0001149524,0.00001323443,0.000002032767,0.00003950544,0.00003276599],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4366938,"threshold_uncertainty_score":0.9999082,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1575452258","doi":"10.46298/dmtcs.625","title":"Isomorphism of graph classes related to the circular-ones property","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Graph isomorphism; Combinatorics; Mathematics; Arc (geometry); Isomorphism (crystallography); Discrete mathematics; Regular polygon; Indifference graph; Graph property; Graph; Line graph; Voltage graph; Geometry; Chemistry","retraction":null,"screen_n_in":null,"score":{"opus":0.01804171732990787,"gpt":0.2762916424278751,"spread":0.2582499250979672,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.002461806,0.0003137153,0.0004195546,0.0003657283,0.0005644249,0.0005993091,0.006172975,0.00007455191,0.0001008521],"category_scores_gemma":[0.0004722431,0.0001591739,0.0001754804,0.003318483,0.004553341,0.0009506609,0.002435282,0.0003611105,0.0003464188],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003685697,"about_ca_system_score_gemma":0.0001317084,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007095365,"about_ca_topic_score_gemma":5.295546e-7,"domain_scores_codex":[0.9957619,0.0002370578,0.0006848089,0.0008467701,0.001571957,0.000897452],"domain_scores_gemma":[0.9957525,0.0007045304,0.0001836965,0.00226364,0.0006800361,0.000415661],"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.000002557593,0.00008771315,0.00002661915,0.00003826582,0.0000147725,0.000004230119,0.002013529,0.0002189516,0.004167189,0.9882678,0.0001303319,0.005027985],"study_design_scores_gemma":[0.0001222334,0.0001852318,0.0002091386,0.000076449,0.000006308269,0.00004391769,0.00009105139,0.2857563,0.003709942,0.7094702,0.00009479864,0.0002344176],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02645773,0.00004307206,0.9627138,0.00531416,0.0002739845,0.001083885,0.000002983077,0.0001671662,0.003943163],"genre_scores_gemma":[0.7530462,0.000005682544,0.2464477,0.0003331876,0.00002091453,0.00007037465,5.805514e-7,0.00001794577,0.00005749936],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7265884,"threshold_uncertainty_score":0.9992041,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W58556464","doi":"10.46298/dmtcs.322","title":"On Locating-Dominating Codes in Binary Hamming Spaces","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"Academy of Finland","keywords":"Hypercube; Hamming code; Computer science; Hamming(7,4); Hamming distance; Multiprocessing; Binary number; Hamming graph; Hamming space; Parallel computing; Theoretical computer science; Mathematics; Block code; Arithmetic; Algorithm; Decoding methods","retraction":null,"screen_n_in":null,"score":{"opus":0.01194002256122808,"gpt":0.2578727969528334,"spread":0.2459327743916054,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002471222,0.0002697195,0.0003619318,0.000351379,0.0004382535,0.0009127285,0.001943723,0.00007089203,0.00001393912],"category_scores_gemma":[0.0002732169,0.0002102474,0.00009256655,0.001318643,0.001028353,0.0006029977,0.0007017095,0.0003079512,0.00006688873],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000149582,"about_ca_system_score_gemma":0.0001035061,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001245103,"about_ca_topic_score_gemma":0.000005175366,"domain_scores_codex":[0.9971008,0.00009639657,0.0005746169,0.0007464028,0.0008002206,0.0006815937],"domain_scores_gemma":[0.9980865,0.0006054481,0.0001777949,0.0008058356,0.0001391654,0.0001852754],"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.000003097468,0.00009389124,0.00001149674,0.00003161807,0.000003163362,0.0000279769,0.003556315,0.01263828,0.0003201299,0.9813452,0.000008965728,0.001959892],"study_design_scores_gemma":[0.0002515595,0.0001997006,0.00002943763,0.0004686864,0.00000178203,0.00003867877,0.0001723852,0.6754814,0.001089892,0.3220496,0.000004936232,0.0002119015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1247757,0.0000164287,0.8686999,0.0008023278,0.0005502097,0.0002269255,6.198769e-7,0.0001353985,0.004792485],"genre_scores_gemma":[0.7820869,0.000001220012,0.2175595,0.0002418827,0.00007665011,0.00001412096,3.998009e-7,0.00001143064,0.000007878979],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6628431,"threshold_uncertainty_score":0.8801462,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2521876311","doi":"10.46298/dmtcs.2463","title":"Walks in the Quarter Plane with Multiple Steps","year":2015,"lang":"fr","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"Austrian Science Fund","keywords":"Mathematics; Combinatorics; Nearest neighbour; Quarter (Canadian coin); Cover (algebra); Humanities; Plane (geometry); Geometry; Geography; Art; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01317334021498557,"gpt":0.2220642555682592,"spread":0.2088909153532736,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.003957782,0.0003955158,0.0004361344,0.0001679288,0.0001932153,0.0005275804,0.001585546,0.0001262289,0.00005912169],"category_scores_gemma":[0.0001031286,0.0002418033,0.00008603835,0.001062487,0.003323715,0.0003963865,0.0001817418,0.0005087915,0.0002255967],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008299996,"about_ca_system_score_gemma":0.00008528854,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000193855,"about_ca_topic_score_gemma":0.00002142601,"domain_scores_codex":[0.9967246,0.0002995111,0.0005446255,0.0004807314,0.001046421,0.0009041103],"domain_scores_gemma":[0.9977207,0.0007631714,0.00008748319,0.000963221,0.0001167817,0.0003487131],"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.00002187082,0.0001342144,0.0002330277,0.0001967932,0.00001776844,0.0000809686,0.02702826,0.002442131,0.00005187942,0.9688395,0.0002625023,0.0006911218],"study_design_scores_gemma":[0.0007339094,0.0004230844,0.0002390377,0.0005944396,0.00003511601,0.0003391386,0.00485346,0.6985711,0.0001849888,0.2931246,0.0004459552,0.0004551],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2226765,0.0005158777,0.7491011,0.002104694,0.001555255,0.0008400626,0.0000268276,0.0001361563,0.02304353],"genre_scores_gemma":[0.9590383,0.000004025212,0.04052157,0.00013258,0.0002017288,0.00003089792,0.000003623911,0.00003265969,0.00003462499],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7363618,"threshold_uncertainty_score":0.9993887,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1846413981","doi":"10.46298/dmtcs.2988","title":"Some exact asymptotics in the counting of walks in the quarter plane","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":21,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Enumeration; Planar; Quarter (Canadian coin); Lattice (music); Plane (geometry); Mathematics; Combinatorics; Probability and statistics; Counting problem; Statistical physics; Discrete mathematics; Physics; Computer science; Statistics; Geometry; Geography; Computer graphics (images)","retraction":null,"screen_n_in":null,"score":{"opus":0.02063901464978406,"gpt":0.2946092653173492,"spread":0.2739702506675651,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008918121,0.0003690565,0.0006073217,0.0002316383,0.0002135036,0.0001919149,0.002615215,0.0001143865,0.00002974667],"category_scores_gemma":[0.001365371,0.0002046938,0.0001301758,0.001182938,0.001854275,0.0006161932,0.0003782941,0.0005796493,0.00001964598],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000075467,"about_ca_system_score_gemma":0.00006132691,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002523843,"about_ca_topic_score_gemma":0.00000195523,"domain_scores_codex":[0.9954154,0.0003690045,0.001127331,0.0003603959,0.001704646,0.001023173],"domain_scores_gemma":[0.992257,0.005750767,0.0004070117,0.001359061,0.0001152162,0.0001109392],"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.000006424683,0.0005202554,0.0002023061,0.0001947781,0.000006259763,0.000006437698,0.02274176,0.00001597003,0.0001665219,0.9759846,0.00006319911,0.00009143355],"study_design_scores_gemma":[0.0003772419,0.0001179279,0.0002968964,0.000255756,0.00003086415,0.00006367255,0.002963385,0.03110863,0.0004827638,0.9640077,0.00002084332,0.0002743476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7193216,0.0001150888,0.2685651,0.001119553,0.0009270851,0.001731275,0.00001357115,0.00009149427,0.008115225],"genre_scores_gemma":[0.9174556,0.00000551703,0.08199826,0.0002214875,0.0002511098,0.00003551266,0.00000117121,0.0000288325,0.000002530959],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1981339,"threshold_uncertainty_score":0.8347172,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2993701604","doi":"10.46298/dmtcs.570","title":"Vertex-colouring edge-weightings with two edge weights","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Weighting; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01134346464713837,"gpt":0.24126704247485,"spread":0.2299235778277116,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002363883,0.0004179581,0.0004295899,0.0003111097,0.0008524631,0.0007732799,0.002692996,0.00007399078,0.00004033147],"category_scores_gemma":[0.0000917802,0.0002764221,0.000123003,0.001535902,0.002416842,0.001412971,0.001380314,0.0003383012,0.0002266317],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005353553,"about_ca_system_score_gemma":0.0001191312,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003405838,"about_ca_topic_score_gemma":4.100012e-7,"domain_scores_codex":[0.9958357,0.00009457232,0.0005318456,0.000844073,0.001301181,0.001392686],"domain_scores_gemma":[0.9968777,0.0004219528,0.0002069425,0.001445885,0.0002898133,0.0007577391],"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.000004131759,0.00016684,0.0001632375,0.00003333412,0.00001259607,0.000008192294,0.002561314,0.00003737671,0.0005897119,0.9947489,0.00005961547,0.001614746],"study_design_scores_gemma":[0.000473143,0.0001887554,0.0001291464,0.0002105321,0.00002471084,0.0001533961,0.00003868762,0.4007449,0.006657053,0.5907594,0.00009529114,0.0005250073],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1654801,0.00009240876,0.8229269,0.0005770214,0.0007634778,0.0002761791,0.000001192063,0.000404493,0.009478197],"genre_scores_gemma":[0.6002973,0.000002058294,0.3993273,0.0002860459,0.00003882574,0.00001196033,6.777099e-7,0.00001738821,0.00001843387],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4348173,"threshold_uncertainty_score":0.9999688,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1581798618","doi":"10.46298/dmtcs.545","title":"A de Bruijn - Erdos theorem and metric spaces","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"De Bruijn sequence; Mathematics; Generalization; Metric space; Combinatorics; Plane (geometry); Set (abstract data type); Discrete mathematics; Chen; Metric (unit); Computer science; Mathematical analysis; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.0191087445210922,"gpt":0.2562057253920496,"spread":0.2370969808709574,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001904464,0.0002198031,0.0002317152,0.000397789,0.0004128307,0.0007580906,0.001465618,0.00005672324,0.00006253366],"category_scores_gemma":[0.0002051296,0.0001728079,0.00006759031,0.001689889,0.001406107,0.0007264419,0.0009269781,0.0001551673,0.00003392995],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003546936,"about_ca_system_score_gemma":0.0001357641,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003519614,"about_ca_topic_score_gemma":3.391638e-7,"domain_scores_codex":[0.9978159,0.00009267076,0.0003169628,0.0006127158,0.0006388951,0.0005228235],"domain_scores_gemma":[0.9984211,0.0003537439,0.000113477,0.0006057762,0.0001759042,0.0003299397],"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.00000308586,0.00006715852,0.00003391367,0.00001999351,0.00000761963,0.000008129797,0.003484286,0.00005181777,0.0003182471,0.9831929,0.0000193285,0.01279353],"study_design_scores_gemma":[0.00009878614,0.0001052406,0.0005172573,0.00001922196,0.000007991363,0.00007568466,0.00003411554,0.5063641,0.001932017,0.4906524,0.00003190904,0.0001612614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03734609,0.00007305224,0.9523513,0.0002816365,0.0002049745,0.0001856679,0.000001474199,0.000149849,0.009405972],"genre_scores_gemma":[0.5565723,0.000006090779,0.4431607,0.0001937542,0.00004160339,0.000006428536,4.679144e-7,0.000005899081,0.00001270222],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5192263,"threshold_uncertainty_score":0.7310284,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2245840520","doi":"10.46298/dmtcs.3417","title":"Labeling planar graphs with a condition at distance two","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"Ministrstvo za visoko šolstvo, znanost in tehnologijo; Technische Universität Berlin","keywords":"Combinatorics; Mathematics; Planar graph; Conjecture; Graph; Degree (music); Planar; Delta; Physics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.00933332684692764,"gpt":0.2453111256069875,"spread":0.2359777987600599,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001276552,0.0003263782,0.0003319945,0.0002391312,0.0008258985,0.0005866671,0.00186803,0.00005165101,0.00003923005],"category_scores_gemma":[0.00004727271,0.0002300168,0.00009023955,0.001302668,0.002462476,0.0007991336,0.0005675198,0.0002225168,0.0001479688],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007361372,"about_ca_system_score_gemma":0.00007864069,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002265156,"about_ca_topic_score_gemma":0.00000612047,"domain_scores_codex":[0.9966063,0.00006486553,0.0004783361,0.0009157406,0.001161387,0.0007733751],"domain_scores_gemma":[0.9977306,0.0002621602,0.0001925917,0.001176292,0.0002523737,0.0003859576],"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.000007729048,0.00008379389,0.00004053395,0.00002182812,0.00000964282,0.00001271977,0.00101865,0.0004952173,0.00127834,0.9950844,0.00007522025,0.001871947],"study_design_scores_gemma":[0.0004106754,0.000130682,0.00001657635,0.0001254639,0.00001169259,0.00009101637,0.00001606169,0.5200589,0.003045769,0.4757065,0.00009031639,0.0002963136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05811948,0.00009424657,0.9365994,0.001443397,0.0001681962,0.0002374751,0.000006142759,0.0003668065,0.002964883],"genre_scores_gemma":[0.5672054,0.000003434893,0.4323042,0.0004293004,0.00001458754,0.00001081599,0.000002721679,0.00001160996,0.00001796182],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5195637,"threshold_uncertainty_score":0.9379811,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1943297633","doi":"10.46298/dmtcs.2080","title":"Diversities and the Geometry of Hypergraphs","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Embedding; Metric (unit); Steiner tree problem; Hypergraph; Combinatorics; Set (abstract data type); Distortion (music); Relation (database); Combinatorial optimization; Discrete mathematics; Algorithm; Computer science; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01021923383462642,"gpt":0.2556408838133856,"spread":0.2454216499787592,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.003997669,0.0001786702,0.0003378623,0.0002681967,0.0004890877,0.0003011762,0.003017996,0.00003747272,0.00001264357],"category_scores_gemma":[0.0004530502,0.0001047673,0.0001025671,0.001278435,0.01342663,0.0004916571,0.002387249,0.000194067,0.00001011015],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001120085,"about_ca_system_score_gemma":0.00003527922,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001822919,"about_ca_topic_score_gemma":1.748846e-7,"domain_scores_codex":[0.997586,0.0002073061,0.0003174975,0.0004693053,0.0009506143,0.0004692535],"domain_scores_gemma":[0.9964414,0.001929131,0.0001251312,0.001119782,0.0002084422,0.0001761772],"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.000009991206,0.000021809,0.000030191,0.00003284693,0.000008094579,8.361201e-7,0.001521568,0.00003924538,0.0001870707,0.9940584,0.000004936971,0.004085063],"study_design_scores_gemma":[0.0002752726,0.00006705073,0.00006050876,0.0000234736,0.000005315656,0.00001356447,0.00006915626,0.4198898,0.0007951743,0.5786995,0.00001274621,0.00008840428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04239967,0.00005530616,0.9515771,0.0007812285,0.0001202448,0.0001926107,0.000001608339,0.00006467403,0.00480758],"genre_scores_gemma":[0.7657966,0.00001059317,0.2340171,0.00013459,0.00002126844,0.000004861727,1.614061e-7,0.000005880654,0.00000890599],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7233969,"threshold_uncertainty_score":0.9892583,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2253259020","doi":"10.46298/dmtcs.3465","title":"Cycles intersecting edge-cuts of prescribed sizes","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Combinatorics; Conjecture; Cubic graph; Planar graph; Graph; Disjoint sets; Disjoint union (topology); Enhanced Data Rates for GSM Evolution; Discrete mathematics; Line graph; Voltage graph","retraction":null,"screen_n_in":null,"score":{"opus":0.01957421339543206,"gpt":0.3028969954445915,"spread":0.2833227820491594,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.002518711,0.0003065361,0.0004495541,0.0003928987,0.0003790989,0.0003916883,0.004630398,0.00006910508,0.00006142529],"category_scores_gemma":[0.0005833428,0.000243294,0.000174375,0.001502684,0.004103161,0.001303728,0.00256926,0.0003394618,0.00006475519],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006490562,"about_ca_system_score_gemma":0.000118845,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001262543,"about_ca_topic_score_gemma":0.000001026392,"domain_scores_codex":[0.9961151,0.0001521867,0.0006942771,0.0008367289,0.00130783,0.0008938126],"domain_scores_gemma":[0.9964805,0.001018786,0.0002358635,0.001537691,0.000384051,0.0003431611],"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.000008582892,0.000118357,0.00003237266,0.00005113884,0.00001186835,0.000004586915,0.003365709,0.000292377,0.005276962,0.9739176,0.00002224961,0.01689817],"study_design_scores_gemma":[0.0001989114,0.0001426957,0.00007445164,0.0001219901,0.000006143017,0.00003251524,0.0001118169,0.5514235,0.03218458,0.415424,0.00003535459,0.000244066],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06224963,0.00004071356,0.9288915,0.0006311036,0.0002212869,0.0003007549,0.000003267089,0.0002091275,0.007452575],"genre_scores_gemma":[0.5733049,0.000003213107,0.4265135,0.000072465,0.00006874678,0.000008290708,3.601714e-7,0.00001264545,0.00001592595],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5584937,"threshold_uncertainty_score":0.9986071,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2306909249","doi":"10.46298/dmtcs.3504","title":"Random assignment and shortest path problems","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Combinatorics; Shortest path problem; Mathematical proof; Path (computing); Discrete mathematics; Random assignment; Random graph; Assignment problem; Limit (mathematics); Similarity (geometry); Distance; Graph; Computer science; Statistics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01297576128991755,"gpt":0.2549273767669025,"spread":0.2419516154769849,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00207682,0.0003399682,0.0004672066,0.0001365382,0.0007500113,0.0003510496,0.0007642848,0.00008884691,0.00009642481],"category_scores_gemma":[0.0002072655,0.0002271764,0.0001158323,0.0003812327,0.003733162,0.0002044429,0.0007415911,0.0002292899,0.000006503667],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003461388,"about_ca_system_score_gemma":0.00003472971,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002421551,"about_ca_topic_score_gemma":8.821871e-7,"domain_scores_codex":[0.9971721,0.0000926717,0.000600755,0.0006068358,0.0008947461,0.0006328764],"domain_scores_gemma":[0.9978398,0.0009373386,0.0001672965,0.0007201948,0.0001197923,0.0002155925],"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.000008606218,0.0001017018,0.00009480739,0.00007413208,0.00001123845,0.000007446935,0.0009927503,0.00003599187,0.0003863134,0.997557,0.0001146104,0.0006153925],"study_design_scores_gemma":[0.0004979696,0.0001020128,0.000140496,0.0001138012,0.00004237883,0.00005744948,0.00005713518,0.1029215,0.0005313383,0.8951789,0.00005231874,0.0003048041],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1561515,0.00006890779,0.8257167,0.0002062586,0.0002622493,0.0005935492,0.00001004343,0.0001672494,0.01682354],"genre_scores_gemma":[0.812032,0.000005874253,0.1876693,0.00007771711,0.0001328761,0.00002039459,0.000001756442,0.00002654114,0.00003351626],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6558805,"threshold_uncertainty_score":0.9989781,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2741277981","doi":"10.46298/dmtcs.3605","title":"Quasisymmetric Schur functions","year":2008,"lang":"fr","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Schur's lemma; Schur algebra; Combinatorics; Schur's theorem; Schur polynomial; Symmetric function; Pure mathematics; Macdonald polynomials; Orthogonal polynomials; Jacobi polynomials; Classical orthogonal polynomials","retraction":null,"screen_n_in":null,"score":{"opus":0.02841310466928626,"gpt":0.2894130763128236,"spread":0.2609999716435374,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":["sts","insufficient_payload"],"category_scores_codex":[0.003226527,0.001109928,0.001510588,0.0008998695,0.002274683,0.0005324106,0.003026224,0.000450376,0.001628844],"category_scores_gemma":[0.004359311,0.001021768,0.0005953725,0.005379252,0.01477638,0.001265982,0.001917307,0.001230406,0.00344695],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005108629,"about_ca_system_score_gemma":0.0005634569,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005441256,"about_ca_topic_score_gemma":9.893195e-7,"domain_scores_codex":[0.9907873,0.0003217479,0.001993574,0.001554125,0.003045317,0.002297919],"domain_scores_gemma":[0.9901875,0.003802661,0.0007723069,0.002902639,0.00112301,0.001211908],"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.0000148264,0.001418664,0.00002125062,0.0006983383,0.00008360169,0.0001235839,0.003715809,0.00009553774,0.0001443217,0.9885195,0.002147522,0.00301697],"study_design_scores_gemma":[0.0007132785,0.0004681961,0.00002090795,0.0006356181,0.0002287443,0.000908787,0.0003720015,0.2150049,0.0007891776,0.7785065,0.001356298,0.0009956579],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02283625,0.0008194744,0.9319161,0.001871159,0.006624497,0.001127315,0.00005978391,0.0004573514,0.03428805],"genre_scores_gemma":[0.3954777,0.0001525092,0.5997924,0.0001877869,0.0009567516,0.00005851833,0.000005753618,0.0001528919,0.003215719],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3726414,"threshold_uncertainty_score":0.9992838,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2139825306","doi":"10.46298/dmtcs.2738","title":"Enumeration of derangements with descents in prescribed positions","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Derangement; Mathematics; Enumeration; Permutation (music); Combinatorics; Generating function; Set (abstract data type); Euler's formula; Combinatorial proof; Point (geometry); Function (biology); Discrete mathematics; Mathematical analysis; Computer science; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01732814136418718,"gpt":0.2982260312454947,"spread":0.2808978898813075,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009201877,0.0002720385,0.0004704487,0.0002502193,0.0001681829,0.0001128008,0.0007707275,0.00006542254,0.0000343578],"category_scores_gemma":[0.0003958265,0.0002091942,0.00006786084,0.0009360816,0.0009275589,0.0004206032,0.0001613553,0.0001966799,0.000007226864],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008521404,"about_ca_system_score_gemma":0.00007333223,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.320994e-7,"about_ca_topic_score_gemma":0.000001354893,"domain_scores_codex":[0.9973096,0.0000723909,0.0007163589,0.0004203645,0.0009828634,0.0004984626],"domain_scores_gemma":[0.9981368,0.0004214148,0.0002761149,0.0007349548,0.0002763329,0.0001544015],"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.00002483932,0.0005941417,0.00003523744,0.00009594209,0.000008729021,0.000006869307,0.001824541,0.00006126903,0.001883307,0.9948138,0.00001003635,0.0006413043],"study_design_scores_gemma":[0.000684418,0.000411838,0.0001768332,0.0004694317,0.00003392288,0.00001640462,0.00008843908,0.06564701,0.007633335,0.9245985,0.000001475914,0.0002383564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2156575,0.000007561463,0.7803487,0.0001837486,0.00009851623,0.0006308773,0.000004374219,0.00007797284,0.002990778],"genre_scores_gemma":[0.6149335,0.000001389016,0.3849746,0.00003913645,0.00002112792,0.00001075876,0.000001434649,0.00001372386,0.00000436242],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.399276,"threshold_uncertainty_score":0.8530693,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2599487098","doi":"10.46298/dmtcs.2336","title":"Gale-Robinson Sequences and Brane Tilings","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Algebraic structures and combinatorial models","field":"Mathematics","cited_by":15,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"National Science Foundation","keywords":"Mathematics; Cluster (spacecraft); Cluster algebra; Combinatorics; Brane; Principal (computer security); Mathematical physics; Statistical physics; Physics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.0151980923668201,"gpt":0.2694502442087206,"spread":0.2542521518419005,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0007434004,0.0002977887,0.0004083778,0.0001072873,0.0003838735,0.0005658773,0.0008747927,0.00009523629,0.0003677066],"category_scores_gemma":[0.0002999658,0.0002095212,0.00008463187,0.0003886381,0.002839274,0.000433555,0.0005452738,0.0002235873,0.00003833937],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003070454,"about_ca_system_score_gemma":0.00006868861,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009222316,"about_ca_topic_score_gemma":4.461511e-7,"domain_scores_codex":[0.997596,0.00005061878,0.0004561485,0.0005646844,0.000752239,0.0005803009],"domain_scores_gemma":[0.9981183,0.0006152319,0.0001454401,0.0006067607,0.0001985224,0.0003156938],"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.000002309677,0.0000329922,0.0000130378,0.00007866016,0.000008767718,0.000002166266,0.001119794,0.000002166093,0.0007300193,0.996841,0.0001100695,0.001058985],"study_design_scores_gemma":[0.0001886586,0.0001048386,0.00004604352,0.00009475674,0.00002137027,0.00004421745,0.0001279632,0.08402664,0.001188427,0.9138712,0.00001705137,0.0002688412],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8053413,0.00005019855,0.1853271,0.0006478126,0.0003907804,0.0005425497,0.000002105298,0.0001755907,0.007522502],"genre_scores_gemma":[0.8715031,0.000009026686,0.1281256,0.000161736,0.0001163769,0.00002146389,5.828177e-7,0.00002300876,0.00003906039],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.08402447,"threshold_uncertainty_score":0.9998744,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1786052730","doi":"10.46298/dmtcs.3419","title":"Fast separation in a graph with an excluded minor","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministerio de Economía y Competitividad","keywords":"Backslash; Combinatorics; Mathematics; Vertex (graph theory); Order (exchange); Graph; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01874154929046081,"gpt":0.3162033184436024,"spread":0.2974617691531416,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002109825,0.0003102351,0.0003382587,0.0005712942,0.0003451724,0.000710641,0.003255895,0.00006492993,0.00003659304],"category_scores_gemma":[0.00007679155,0.0002285977,0.00006631268,0.002550206,0.002695335,0.002360349,0.0007538655,0.0003283504,0.00006617656],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008272603,"about_ca_system_score_gemma":0.000140776,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001850813,"about_ca_topic_score_gemma":0.00001398182,"domain_scores_codex":[0.9961427,0.0001722015,0.0004685638,0.0009980433,0.001292252,0.0009261931],"domain_scores_gemma":[0.9974517,0.0002874166,0.0001200862,0.001496938,0.0002288374,0.0004150824],"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.00002179488,0.0002019982,0.00004510465,0.00001593391,0.00000390041,0.0000167189,0.002861621,0.001546173,0.0009932417,0.9841531,0.000003666219,0.01013678],"study_design_scores_gemma":[0.0003176069,0.0003406921,0.0001258568,0.00004933025,0.000002744503,0.0000483211,0.00005808063,0.6244558,0.002751521,0.3715807,0.00001120567,0.0002580935],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1114994,0.00001364973,0.8842687,0.0005947525,0.00005812442,0.0003917269,0.000001792115,0.0001692641,0.003002546],"genre_scores_gemma":[0.548983,0.000001516846,0.4508013,0.0001279183,0.00003939396,0.00002305213,0.000001175684,0.00001158109,0.00001101273],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6229097,"threshold_uncertainty_score":0.9931073,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963906392","doi":"10.46298/dmtcs.6416","title":"Counting quadrant walks via Tutte's invariant method (extended abstract)","year":2020,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"Agence Nationale de la Recherche; National Science Foundation","keywords":"Enumeration; Mathematical proof; Algebraic number; Mathematics; Invariant (physics); Quadrant (abdomen); Algebraic function; Discrete mathematics; Combinatorics; Mathematical analysis; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.0298702935328634,"gpt":0.3198436684039755,"spread":0.2899733748711121,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003767866,0.0007278004,0.001168765,0.0001824139,0.0006766926,0.0005918824,0.00257637,0.0002012597,0.0003571688],"category_scores_gemma":[0.003434379,0.0005893158,0.0003063134,0.001375246,0.002005405,0.0006977812,0.001401132,0.0008001033,0.0002264523],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001341865,"about_ca_system_score_gemma":0.0001997988,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002657442,"about_ca_topic_score_gemma":6.188458e-7,"domain_scores_codex":[0.9935839,0.0001639932,0.001565887,0.001245252,0.00213069,0.001310325],"domain_scores_gemma":[0.9936058,0.002948256,0.000691889,0.001409318,0.0005052244,0.0008395125],"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.00002250835,0.0002450125,0.000001949638,0.0004637683,0.00003962794,0.00005143862,0.004659719,0.00005318374,0.00541842,0.9868655,0.0001071836,0.002071716],"study_design_scores_gemma":[0.0004034852,0.0001495768,0.000006447746,0.0001541754,0.00006943532,0.00005944506,0.0001944458,0.3610029,0.004492753,0.6329185,0.0000526948,0.0004961256],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007985354,0.00001844891,0.9809573,0.001681011,0.0005429359,0.0008599493,0.00001254421,0.0005622563,0.007380212],"genre_scores_gemma":[0.4572721,0.000002343661,0.5419006,0.0004579962,0.000260678,0.00002380819,0.000002074353,0.00007408152,0.000006301821],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4492867,"threshold_uncertainty_score":0.9996558,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1766799846","doi":"10.23638/dmtcs-22-4-4","title":"Evacuating Robots from a Disk Using Face-to-Face Communication","year":2020,"lang":"en","type":"preprint","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"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":"Robot; Unit disk; Approx; Upper and lower bounds; Face (sociological concept); Boundary (topology); Computer science; Unit (ring theory); Algorithm; Combinatorics; Mathematics; Artificial intelligence; Mathematical analysis; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.05559212295919166,"gpt":0.3286861245468449,"spread":0.2730940015876533,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.002117051,0.0006017826,0.0007744122,0.0003078545,0.000801237,0.003183205,0.009471524,0.0002178923,0.00005831539],"category_scores_gemma":[0.0006360873,0.0005349234,0.0002188288,0.001521145,0.001439121,0.0006962842,0.0188202,0.001090833,0.0001580724],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001971169,"about_ca_system_score_gemma":0.0004639497,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002647436,"about_ca_topic_score_gemma":0.000001490807,"domain_scores_codex":[0.9940856,0.0004167864,0.00100145,0.001733162,0.001875375,0.0008876207],"domain_scores_gemma":[0.9941882,0.0007215799,0.0004648375,0.003302927,0.0004657506,0.000856736],"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.000004186697,0.00008530181,0.000007381967,0.00009880312,0.00002875412,0.000006299801,0.01395528,0.1466391,0.0007066313,0.8355038,0.00004515344,0.002919334],"study_design_scores_gemma":[0.0001229595,0.00004927997,0.00001702458,0.0004565334,0.00001950452,0.000003813793,0.00009505545,0.6790571,0.0004468583,0.3192839,0.000009305179,0.0004386475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004787519,0.00006410079,0.9861707,0.005507914,0.0004418713,0.001144761,0.00003941691,0.0004512785,0.001392405],"genre_scores_gemma":[0.4118961,0.00001180011,0.5874079,0.0005363208,0.00006829089,0.00002667279,0.00001945451,0.00002890674,0.000004539942],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5324181,"threshold_uncertainty_score":0.9997102,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W50494007","doi":"10.46298/dmtcs.3432","title":"Color critical hypergraphs and forbidden configurations","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Hungarian Scientific Research Fund; Fonds National de la Recherche Luxembourg","keywords":"Combinatorics; Mathematics; Simple (philosophy); Matrix (chemical analysis); Permutation (music); Upper and lower bounds; Generalization; Discrete mathematics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.008544014444155194,"gpt":0.2390429806078696,"spread":0.2304989661637144,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006163727,0.0001777216,0.0002163446,0.0001155391,0.0002923278,0.0002720893,0.0003990491,0.00005811404,0.0001055989],"category_scores_gemma":[0.00009162926,0.0001440039,0.00005686393,0.000332509,0.002379495,0.000303975,0.0001004281,0.0001398979,0.00006362987],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001666297,"about_ca_system_score_gemma":0.00001491385,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":2.384081e-7,"about_ca_topic_score_gemma":6.610086e-7,"domain_scores_codex":[0.9987018,0.00003038339,0.0002968769,0.0002595395,0.0003145551,0.0003968065],"domain_scores_gemma":[0.9989826,0.0003509951,0.0000192406,0.0003320661,0.00007379027,0.000241285],"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.000001450404,0.00002059456,0.00000552967,0.00005210916,0.000007041628,0.000002005417,0.0008453641,0.0001995726,0.00271921,0.9949685,0.00005280483,0.001125819],"study_design_scores_gemma":[0.0001087132,0.00005051555,0.00004752895,0.00005401394,0.00001717006,0.00006272757,0.0001316035,0.7334288,0.002187528,0.2634576,0.0002465444,0.0002072104],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2434074,0.0001334239,0.7248011,0.0005896523,0.0003625579,0.0002670801,0.00001327767,0.000360474,0.03006502],"genre_scores_gemma":[0.9469234,0.000006465054,0.05283239,0.00009210149,0.0001022821,0.00001765405,0.000001089734,0.00001693915,0.000007675474],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7332293,"threshold_uncertainty_score":0.8767347,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2121104987","doi":"10.46298/dmtcs.1264","title":"On the Meyniel condition for hamiltonicity in bipartite digraphs","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"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":"Digraph; Bipartite graph; Combinatorics; Mathematics; Hamiltonian (control theory); Discrete mathematics; Hamiltonian path; Strongly connected component; Graph","retraction":null,"screen_n_in":null,"score":{"opus":0.01944146827243976,"gpt":0.3031915034484831,"spread":0.2837500351760434,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.005269203,0.0002568899,0.0003029376,0.0003211494,0.0005850093,0.0005431676,0.003442801,0.00006147017,0.00002792219],"category_scores_gemma":[0.001142083,0.0001628333,0.0001418922,0.001548043,0.003018135,0.0005270015,0.0007456932,0.0003212247,0.00005044519],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005167206,"about_ca_system_score_gemma":0.00006260768,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.820955e-7,"about_ca_topic_score_gemma":0.000001509204,"domain_scores_codex":[0.9967426,0.0002457042,0.0004343473,0.000781547,0.0009496149,0.000846156],"domain_scores_gemma":[0.9939827,0.004014186,0.0001257564,0.001475277,0.0001941612,0.0002078834],"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.00001040489,0.00008473432,0.000009683119,0.00002075076,0.000003791654,0.000001247661,0.0007902883,0.0002518317,0.0006053041,0.9965698,0.00003847881,0.001613686],"study_design_scores_gemma":[0.0001565891,0.0001589254,0.00004070217,0.00004702034,0.000001761743,0.000003224159,0.0000174695,0.4761099,0.003109451,0.5202013,0.00003140816,0.0001222399],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0484057,0.000006644606,0.9448325,0.001830863,0.0001866882,0.0006635045,0.0000050529,0.0001115039,0.00395751],"genre_scores_gemma":[0.8627684,0.000002014721,0.13643,0.0006386177,0.00003632543,0.0001019957,0.000001369292,0.00001389325,0.000007443721],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8143626,"threshold_uncertainty_score":0.9996951,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1592608789","doi":"10.46298/dmtcs.450","title":"Diophantine Approximation, Ostrowski Numeration and the Double-Base Number System","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Pacific Institute for the Mathematical Sciences","funders":"","keywords":"Mathematics; Diophantine equation; Correctness; Partition (number theory); Base (topology); Integer (computer science); Combinatorics; Order (exchange); Discrete mathematics; Algorithm; Mathematical analysis; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.0113201498828838,"gpt":0.2691241931922988,"spread":0.257804043309415,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.003122692,0.0002649902,0.0003933132,0.00007692431,0.0007061452,0.001325133,0.001622502,0.00005200754,0.00001074044],"category_scores_gemma":[0.000113313,0.0001514149,0.00009869023,0.001006368,0.002033225,0.0007064358,0.000493268,0.0002090192,0.00003878947],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003251457,"about_ca_system_score_gemma":0.00005000582,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000211985,"about_ca_topic_score_gemma":4.751289e-8,"domain_scores_codex":[0.9972706,0.0001845341,0.0005268502,0.0006545935,0.0008580327,0.0005054103],"domain_scores_gemma":[0.9979721,0.0004448797,0.0001906071,0.0009288319,0.0002168581,0.0002466628],"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.00001419863,0.00004392084,0.000003027741,0.00002691285,0.000004547232,0.000004240983,0.0007878242,0.00002424582,0.000205161,0.9814942,0.000009049923,0.0173826],"study_design_scores_gemma":[0.0007361939,0.00005904338,0.00004308345,0.00005659194,0.00001115274,0.00009064047,0.00003902256,0.6791541,0.00128611,0.3183485,0.00001108024,0.0001645029],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003817642,0.00002937472,0.9864708,0.0040201,0.0002873538,0.0004610957,0.000001270453,0.0002148759,0.004697478],"genre_scores_gemma":[0.500637,0.000002403171,0.4989848,0.0002664647,0.00008493597,0.00001169399,5.814854e-7,0.000005166358,0.000006904844],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6791298,"threshold_uncertainty_score":0.9997116,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4307260506","doi":"10.46298/dmtcs.8877","title":"Improved product structure for graphs on surfaces","year":2022,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Australian Research Council; Banff International Research Station for Mathematical Innovation and Discovery; Australian Government","keywords":"Treewidth; Combinatorics; Mathematics; Planar graph; 1-planar graph; Graph; Pathwidth; Partial k-tree; Graph minor; Outerplanar graph; Discrete mathematics; Chordal graph; Line graph; Graph power","retraction":null,"screen_n_in":null,"score":{"opus":0.01608801963285116,"gpt":0.29082658547601,"spread":0.2747385658431588,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.002673563,0.0003450635,0.0003761713,0.0004098653,0.001763887,0.0005688724,0.005506197,0.00003375797,0.00008724207],"category_scores_gemma":[0.0003204804,0.0002740586,0.0001752546,0.002100847,0.002204194,0.0005403595,0.002683965,0.000502256,0.000007381595],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009830836,"about_ca_system_score_gemma":0.0001759432,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.144774e-7,"about_ca_topic_score_gemma":3.551037e-7,"domain_scores_codex":[0.9954731,0.000193123,0.0004394775,0.001325669,0.001518039,0.001050602],"domain_scores_gemma":[0.9965177,0.0008584536,0.0001763898,0.001871953,0.0002728825,0.0003026669],"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.00002903309,0.0001112636,0.000004590921,0.00003881472,0.00001131112,0.000004303882,0.000950316,0.001395538,0.006068869,0.9869791,0.00005952825,0.004347293],"study_design_scores_gemma":[0.0001952773,0.0004626945,0.00000946155,0.000009270009,0.000003771559,0.00002111513,0.00004221747,0.4497563,0.005643046,0.543552,0.00008485101,0.0002199987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03546138,0.00003008641,0.9602295,0.001466096,0.0006731866,0.001181148,0.0000600783,0.0002583024,0.0006402921],"genre_scores_gemma":[0.6563263,0.000001021611,0.3432312,0.0002566716,0.0000407175,0.00009416829,0.000003796634,0.00002125865,0.000024862],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6208649,"threshold_uncertainty_score":0.9999712,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2114421280","doi":"10.46298/dmtcs.3513","title":"The Diameter of the Minimum Spanning Tree of a Complete Graph","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Combinatorics; Spanning tree; Minimum spanning tree; Graph; Independent and identically distributed random variables; Minimum degree spanning tree; Tree (set theory); Enhanced Data Rates for GSM Evolution; Discrete mathematics; Statistics; Random variable","retraction":null,"screen_n_in":null,"score":{"opus":0.01833519680599264,"gpt":0.2756959081426852,"spread":0.2573607113366926,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.002884387,0.0002575507,0.0003941464,0.0001956762,0.0007123595,0.0002811205,0.006629078,0.00005049714,0.000007567035],"category_scores_gemma":[0.0003187997,0.0001349913,0.0002931125,0.002339467,0.01086355,0.0003637483,0.001909756,0.0002836358,0.000006670703],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002611521,"about_ca_system_score_gemma":0.0001091001,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000494302,"about_ca_topic_score_gemma":0.000003367814,"domain_scores_codex":[0.9960195,0.0002597601,0.0007808376,0.0005563636,0.001623056,0.0007604894],"domain_scores_gemma":[0.9948206,0.002057358,0.0003996604,0.002207528,0.0003891453,0.0001257336],"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.000006711389,0.00006566161,0.00009584251,0.00003294402,0.000009600111,0.000001504025,0.0005525217,0.0001640786,0.008682807,0.9882458,0.00002784109,0.002114729],"study_design_scores_gemma":[0.0001590881,0.00009711421,0.0007031282,0.00008814477,0.000008313948,0.00001335551,0.00004501587,0.2507296,0.01447251,0.7335119,0.00002908925,0.0001427766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02467008,0.00007295152,0.969394,0.0007691047,0.0002589255,0.0003867552,0.000007121547,0.00005013288,0.00439094],"genre_scores_gemma":[0.7564095,0.000002956594,0.2434654,0.0000449456,0.00003158033,0.00001139218,3.062776e-7,0.00001238534,0.00002156162],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7317394,"threshold_uncertainty_score":0.9987456,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W372230892","doi":"10.46298/dmtcs.6351","title":"Cataland: Why the Fuss?","year":2020,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Deutsche Forschungsgemeinschaft","keywords":"Mathematics; Coxeter group; Catalan number; Combinatorics; Generalization; Cluster algebra; Catalan; Perspective (graphical); Monoid; Algebra over a field; Pure mathematics; Humanities; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.0267277116258899,"gpt":0.2918522601424824,"spread":0.2651245485165925,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.001611657,0.0004524265,0.0005995619,0.00007823378,0.0006986017,0.0004653205,0.002876864,0.00009515679,0.0001948258],"category_scores_gemma":[0.003243837,0.0002762912,0.0002034317,0.001214716,0.003476219,0.0003819159,0.001345283,0.0005048605,0.0001962363],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005768051,"about_ca_system_score_gemma":0.0001058025,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.708767e-7,"about_ca_topic_score_gemma":4.395258e-7,"domain_scores_codex":[0.9959961,0.0001207901,0.0007931672,0.0007278897,0.001513595,0.0008484842],"domain_scores_gemma":[0.9948959,0.00262717,0.0003109538,0.001369828,0.0002735693,0.0005225141],"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.000009806098,0.00009353986,0.000003853714,0.0001414188,0.00001783459,0.00001078676,0.004998748,0.00001651618,0.0003001518,0.9926738,0.001299947,0.0004336429],"study_design_scores_gemma":[0.000292661,0.0001557206,0.000002469268,0.0000731331,0.00005170844,0.00003467334,0.0002894017,0.1511563,0.001683026,0.8453751,0.0005429458,0.0003429171],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01233225,0.00002587508,0.9692426,0.008796039,0.0005069443,0.0007560406,0.00001111457,0.000404711,0.007924402],"genre_scores_gemma":[0.7003594,0.000004296908,0.2968962,0.002211099,0.0004114928,0.00003552348,0.000001907038,0.00006507197,0.00001503524],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6880271,"threshold_uncertainty_score":0.9999689,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2284354567","doi":"10.46298/dmtcs.2972","title":"Orbits of the Bernoulli measure in single-transition asynchronous cellular automata","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Compute Canada","keywords":"Bernoulli's principle; Measure (data warehouse); Mathematics; Cellular automaton; Bernoulli scheme; Binary number; Asynchronous communication; Stochastic cellular automaton; Orbit (dynamics); Automaton; Statistical physics; Combinatorics; Algorithm; Physics; Computer science; Theoretical computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01841264001235938,"gpt":0.223909706909668,"spread":0.2054970668973087,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001214923,0.0002212239,0.0002939357,0.0001568504,0.0002473512,0.0001619906,0.003470159,0.00007524928,0.0000345779],"category_scores_gemma":[0.00006096869,0.0001543814,0.0001323231,0.001544176,0.001886916,0.0004445615,0.0008880675,0.0002076308,0.00003115835],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005468383,"about_ca_system_score_gemma":0.0001266761,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001027264,"about_ca_topic_score_gemma":0.000003601938,"domain_scores_codex":[0.9974445,0.0001029505,0.0005470681,0.000569971,0.000864508,0.0004710264],"domain_scores_gemma":[0.9977422,0.0001262647,0.0001866941,0.00165062,0.0001540455,0.0001401796],"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.000001632145,0.0003165615,0.00002144426,0.00004326906,0.000004470376,0.000004778742,0.005385306,0.0000384663,0.01285214,0.9788504,0.000005095651,0.002476494],"study_design_scores_gemma":[0.0002207934,0.00009372983,0.0006214363,0.0001862041,0.00001435793,0.00003078637,0.00005564775,0.6607698,0.07682328,0.2609384,0.000008844712,0.0002367093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07459003,0.00002667541,0.9186918,0.0003812645,0.0001751981,0.0003690949,0.000004411335,0.0001199834,0.005641543],"genre_scores_gemma":[0.7961495,0.000001402825,0.2037295,0.00007373586,0.00001781545,0.00001374699,0.000001028634,0.00001050502,0.00000281106],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7215594,"threshold_uncertainty_score":0.6952422,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1622363968","doi":"10.46298/dmtcs.2873","title":"On $k$-crossings and $k$-nestings of permutations","year":2010,"lang":"fr","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":true,"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; Centre National de la Recherche Scientifique","keywords":"Combinatorics; Mathematics; Corollary; Permutation (music); Parity of a permutation; Distribution (mathematics); Symmetric group; Physics; Cyclic permutation","retraction":null,"screen_n_in":null,"score":{"opus":0.0137209927197438,"gpt":0.3001545423667265,"spread":0.2864335496469826,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.002667018,0.0006270246,0.0009502036,0.0003213254,0.0007548588,0.0005535808,0.00137541,0.000297878,0.0003089861],"category_scores_gemma":[0.005792574,0.0005546823,0.0001971763,0.001126114,0.01676286,0.0005570995,0.0009507983,0.001041237,0.00007541336],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006329289,"about_ca_system_score_gemma":0.0002597129,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004418544,"about_ca_topic_score_gemma":0.000001873186,"domain_scores_codex":[0.9952848,0.0001013995,0.001288509,0.000884884,0.001445758,0.0009946316],"domain_scores_gemma":[0.9914579,0.005061034,0.0007262664,0.001455534,0.000723156,0.0005761444],"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.00001258848,0.0006079104,0.000009888109,0.001021808,0.00002393289,0.00001270163,0.007779887,0.00002438299,0.005033609,0.9824314,0.00006900205,0.002972893],"study_design_scores_gemma":[0.0004602653,0.000372205,0.00002044829,0.0008861689,0.0001183551,0.000157194,0.0002201606,0.1993965,0.004385026,0.7934534,0.00007255248,0.0004576953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4270138,0.00006782995,0.5587966,0.001259054,0.002406212,0.000652515,0.00003918296,0.0001228474,0.009641919],"genre_scores_gemma":[0.5679943,0.000007104396,0.4315246,0.00007279194,0.0001596752,0.00001264399,0.000001211118,0.00005903712,0.0001685833],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.1993721,"threshold_uncertainty_score":0.9996905,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W112721313","doi":"10.46298/dmtcs.412","title":"Properties of the extremal infinite smooth words","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"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":"Lexicographical order; De Bruijn sequence; Alphabet; Fibonacci number; Combinatorics; Mathematics; Graph; De Bruijn graph; Word (group theory); Sequence (biology); Reduction (mathematics); Order (exchange); Construct (python library); Discrete mathematics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01691437624846669,"gpt":0.2409065103782006,"spread":0.2239921341297339,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.003652381,0.000257768,0.0003182593,0.0001766955,0.0004075288,0.0003519622,0.004647919,0.00006702948,0.00002452691],"category_scores_gemma":[0.0002329295,0.0001455786,0.0001694363,0.001555955,0.004196698,0.000551652,0.00224115,0.0002398263,0.00002188282],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000036371,"about_ca_system_score_gemma":0.0001432768,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002562689,"about_ca_topic_score_gemma":0.000001090944,"domain_scores_codex":[0.9968536,0.00008022534,0.000631412,0.0005377032,0.001196311,0.0007006763],"domain_scores_gemma":[0.9973918,0.0003360364,0.0002433782,0.001639344,0.0001939617,0.0001954459],"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.00000429815,0.00007520634,0.00004737409,0.00004315111,0.000005701876,0.00000343794,0.003004366,0.00001992458,0.008013913,0.9807922,0.000009578755,0.007980839],"study_design_scores_gemma":[0.0002202388,0.000103186,0.000906953,0.0003465257,0.00001351543,0.00004925359,0.0001974494,0.4945133,0.07025453,0.4329675,0.00007108102,0.0003565096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.160786,0.00005278603,0.833048,0.0004743977,0.0004585006,0.0002266189,0.000001373855,0.0001296142,0.004822713],"genre_scores_gemma":[0.8406892,0.000001806476,0.158923,0.0002875708,0.00006466216,0.000003765893,1.404562e-7,0.00001186529,0.00001798757],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6799032,"threshold_uncertainty_score":0.9985133,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2311329553","doi":"10.46298/dmtcs.2879","title":"Unitary Matrix Integrals, Primitive Factorizations, and Jucys-Murphy Elements","year":2010,"lang":"fr","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Factorization; Permutation (music); Unitary state; Permutation group; Hierarchy; Unique factorization domain; Symmetric group; Algebra over a field; Pure mathematics; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.007806484410012074,"gpt":0.2444805342455688,"spread":0.2366740498355567,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.001826669,0.0004811832,0.0004813736,0.0002699554,0.0005191853,0.0005847234,0.0009922704,0.0002150669,0.0004121894],"category_scores_gemma":[0.0002098888,0.0004193292,0.0001250266,0.0008926144,0.004525666,0.0006156312,0.000517337,0.0007824691,0.0001228318],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005094465,"about_ca_system_score_gemma":0.0000791689,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001027402,"about_ca_topic_score_gemma":0.000005272047,"domain_scores_codex":[0.9970109,0.0001369618,0.0007331779,0.0006107545,0.0006576687,0.0008505115],"domain_scores_gemma":[0.9978805,0.0004948807,0.0001387052,0.0007523633,0.0002167126,0.0005168667],"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.000004083333,0.00009070816,0.0001434405,0.0003358512,0.00004485476,0.00001144625,0.003472965,0.0000587043,0.004313237,0.9874273,0.00007136114,0.004026055],"study_design_scores_gemma":[0.0002784166,0.0001384623,0.0002977345,0.0004222241,0.00008931875,0.0001071864,0.0007904718,0.4172733,0.002692495,0.5766327,0.0007008895,0.0005768877],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3599477,0.0004364084,0.6270497,0.0005917739,0.003796932,0.0005887164,0.0001041961,0.0002003785,0.007284179],"genre_scores_gemma":[0.8441656,0.00004653116,0.1552571,0.00005311627,0.0002619692,0.00001639895,0.00001184563,0.0000472703,0.00014018],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4842179,"threshold_uncertainty_score":0.9998258,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1785579362","doi":"10.46298/dmtcs.3514","title":"Complete k-ary trees and generalized meta-Fibonacci sequences","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":true,"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":"Fibonacci number; Mathematics; Pisano period; Combinatorics; Integer (computer science); Integer sequence; Fibonacci polynomials; Recurrence relation; Tree (set theory); Discrete mathematics; Generating function","retraction":null,"screen_n_in":null,"score":{"opus":0.04098623905400932,"gpt":0.3044220091288604,"spread":0.263435770074851,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.002006056,0.0006303475,0.001214377,0.0002509184,0.0006539273,0.0005225584,0.001393892,0.0001273067,0.0002363395],"category_scores_gemma":[0.0007015381,0.0004507979,0.0002959791,0.0008251385,0.004270418,0.0005365104,0.0009215029,0.0003086436,0.00003104799],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007387427,"about_ca_system_score_gemma":0.0001006662,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000102249,"about_ca_topic_score_gemma":0.000005991873,"domain_scores_codex":[0.9954826,0.000169485,0.001090593,0.0009215496,0.001391715,0.00094406],"domain_scores_gemma":[0.9957739,0.001934336,0.0004202038,0.001179424,0.0002928062,0.0003993154],"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.000008181897,0.0001609422,0.000007915838,0.0001408587,0.00009098947,0.0000168994,0.0004425244,0.00003917208,0.002061192,0.9966784,0.0001413434,0.0002116413],"study_design_scores_gemma":[0.0004430075,0.0001235576,0.00001652254,0.0000706281,0.000427264,0.00009564676,0.00006561066,0.0994101,0.001444423,0.8972504,0.0001267292,0.000526139],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0812043,0.0002382408,0.9075116,0.0007623929,0.000466967,0.0008641141,0.00004202203,0.0004831352,0.008427214],"genre_scores_gemma":[0.4584406,0.000007840034,0.5411331,0.0001038128,0.0001650447,0.0000461285,0.000004385723,0.0000478327,0.0000512819],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3772363,"threshold_uncertainty_score":0.9997944,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2133087912","doi":"10.46298/dmtcs.397","title":"On the critical exponent of generalized Thue-Morse words","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"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":"Infimum and supremum; Exponent; Mathematics; Morse code; Set (abstract data type); Critical exponent; Discrete mathematics; Pure mathematics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01614136682013868,"gpt":0.2813352824947019,"spread":0.2651939156745632,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.005911975,0.000309902,0.0003909367,0.0002183071,0.0004577048,0.0004046761,0.004036618,0.00007588728,0.0001410869],"category_scores_gemma":[0.0007921832,0.0001823398,0.0001926683,0.001157912,0.004434966,0.0003708548,0.00131315,0.0002912872,0.00006947247],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004413109,"about_ca_system_score_gemma":0.00008826553,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000203104,"about_ca_topic_score_gemma":3.567873e-7,"domain_scores_codex":[0.9961448,0.0001461953,0.0007081463,0.0006811611,0.001468218,0.0008514424],"domain_scores_gemma":[0.994041,0.003463885,0.0001691622,0.001805992,0.0002087748,0.0003111935],"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.00001053187,0.0001662264,0.000003232524,0.00002335596,0.000007551301,0.00001656558,0.001891385,0.00002163461,0.002017599,0.9929975,0.00008126169,0.002763203],"study_design_scores_gemma":[0.0001378956,0.0001584115,0.00006371932,0.00009971756,0.000008081042,0.00002627963,0.00009454634,0.3133587,0.01582426,0.6700062,0.00001872647,0.0002035236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1089817,0.00002614278,0.8827314,0.00232872,0.0004918343,0.0002340533,0.000003157408,0.0001459087,0.00505711],"genre_scores_gemma":[0.765916,0.000002312487,0.233141,0.0008356054,0.00007530392,0.000007345201,4.748563e-7,0.00001347294,0.000008446319],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6569343,"threshold_uncertainty_score":0.9982744,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2513478778","doi":"10.46298/dmtcs.2151","title":"Connected Tropical Subgraphs in Vertex-Colored Graphs","year":2016,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Université Paris-Sud; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Combinatorics; Mathematics; Distance-hereditary graph; Induced subgraph isomorphism problem; Graph factorization; Discrete mathematics; Vertex (graph theory); Colored; Vertex connectivity; Graph; Line graph; Graph power; Voltage graph","retraction":null,"screen_n_in":null,"score":{"opus":0.01489797696201653,"gpt":0.2796557446757296,"spread":0.264757767713713,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.001814739,0.0004030941,0.0005387421,0.0008549923,0.000351579,0.0004274552,0.004969183,0.0001231276,0.0001162139],"category_scores_gemma":[0.0008162098,0.0002546245,0.0001904569,0.003600647,0.005863239,0.001214904,0.001752242,0.0003466296,0.0001442189],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001157877,"about_ca_system_score_gemma":0.0001726398,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001528178,"about_ca_topic_score_gemma":0.000004442917,"domain_scores_codex":[0.9947438,0.0002909226,0.0007220947,0.001312367,0.001480547,0.001450281],"domain_scores_gemma":[0.9953508,0.001806769,0.0001405393,0.00184707,0.0002987026,0.0005560637],"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.00002280868,0.0001443623,0.000556741,0.00001772385,0.000008092655,0.0000497118,0.000650066,0.000006746864,0.004708173,0.9870759,0.00001893401,0.006740731],"study_design_scores_gemma":[0.0007865113,0.0002262379,0.002036322,0.0001477837,0.000004075339,0.00004394201,0.00002952475,0.1210901,0.004411297,0.8708114,0.0000201736,0.0003926457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1734217,0.00002175083,0.8221879,0.001489458,0.0002967973,0.0004152135,0.00000468691,0.0002668241,0.001895703],"genre_scores_gemma":[0.8083445,0.00001271004,0.1913758,0.0001706557,0.0000193907,0.00003989916,5.146558e-7,0.00002108571,0.000015385],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6349229,"threshold_uncertainty_score":0.9999906,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2136786922","doi":"10.46298/dmtcs.2968","title":"Conservation Laws and Invariant Measures in Surjective Cellular Automata","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"Academy of Finland","keywords":"Surjective function; Mathematics; Corollary; Conservation law; Invariant (physics); Cellular automaton; Bernoulli's principle; Discrete mathematics; Markov chain; Probability measure; Invariant measure; Transitive relation; Generalization; Pure mathematics; Bernoulli process; Combinatorics; Mathematical analysis; Algorithm; Mathematical physics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.02603374664689424,"gpt":0.2410239080550224,"spread":0.2149901614081282,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017738,0.0002114199,0.0002629469,0.0002218162,0.0002720197,0.0003749625,0.001589691,0.00006289338,0.00001850889],"category_scores_gemma":[0.0001113048,0.0001754748,0.0000473218,0.001042877,0.001569631,0.0006951118,0.0009687317,0.0001713505,0.00003406332],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003748591,"about_ca_system_score_gemma":0.0001073525,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003426603,"about_ca_topic_score_gemma":0.00000925099,"domain_scores_codex":[0.9978114,0.00009563792,0.0004210417,0.0006790505,0.000551601,0.0004412621],"domain_scores_gemma":[0.9983697,0.0002254441,0.0001174723,0.0009576752,0.0001325922,0.0001971503],"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.000001971551,0.0001370539,0.0001114936,0.00001829341,0.000004070024,0.00001274649,0.00440116,0.000002576004,0.001873126,0.9913947,0.00001080653,0.00203198],"study_design_scores_gemma":[0.0002033862,0.00005155011,0.001534131,0.00004082764,0.000005729592,0.00002516977,0.00005467867,0.6080704,0.005807531,0.3839981,0.00002096314,0.0001874726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05776878,0.00002566675,0.9353357,0.0004724661,0.00009063136,0.0003323304,0.000002700003,0.0001826989,0.005789004],"genre_scores_gemma":[0.703476,0.000005048634,0.2963235,0.0001475536,0.00001281411,0.00002162148,0.000001330571,0.000007917809,0.000004206904],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6457072,"threshold_uncertainty_score":0.7155653,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2244023066","doi":"10.46298/dmtcs.2839","title":"Crystals from categorified quantum groups","year":2010,"lang":"fr","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Algebraic structures and combinatorial models","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"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; Quotient; Grothendieck group; Quantum; Pure mathematics; Quantum group; Algebra over a field; Humanities; Physics; Philosophy; Quantum mechanics","retraction":null,"screen_n_in":null,"score":{"opus":0.01534059310465425,"gpt":0.2675785840521044,"spread":0.2522379909474501,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002303676,0.0008603706,0.001118616,0.0002073126,0.0008967107,0.001337541,0.003193149,0.0005718844,0.003090265],"category_scores_gemma":[0.001028651,0.0007190294,0.0004161909,0.0009921353,0.008938155,0.0006731438,0.001595317,0.001519052,0.0003553558],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000994534,"about_ca_system_score_gemma":0.0003626714,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006663684,"about_ca_topic_score_gemma":0.00001046104,"domain_scores_codex":[0.9935234,0.0001885758,0.001324576,0.001399496,0.001934077,0.00162993],"domain_scores_gemma":[0.9935463,0.002097761,0.0005030106,0.00241606,0.0004887853,0.0009480531],"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.00001899682,0.0003259071,0.00001038784,0.0001870858,0.00006414831,0.00003140462,0.004518143,0.00001110508,0.002881477,0.9900163,0.0003002383,0.001634843],"study_design_scores_gemma":[0.0004620044,0.0001566152,0.0000299914,0.0001982722,0.0001558848,0.00005222252,0.0002437514,0.2479212,0.001981661,0.7478107,0.0002948497,0.0006928066],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4455636,0.0002156419,0.5328029,0.001991435,0.01342891,0.0006471783,0.00007095615,0.0002093194,0.005070106],"genre_scores_gemma":[0.8361348,0.00001894483,0.1615745,0.0002305553,0.001764352,0.00002304962,0.00001065747,0.0000967851,0.0001463855],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.3905712,"threshold_uncertainty_score":0.9996992,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W957038697","doi":"10.46298/dmtcs.2846","title":"On joint distribution of adjacencies, descents and some Mahonian statistics","year":2010,"lang":"fr","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Conjecture; Distribution (mathematics); Combinatorics; Euler's formula; Humanities; Joint probability distribution; Statistics; Philosophy; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01580369162920817,"gpt":0.2742869174742312,"spread":0.258483225845023,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.002675857,0.0007302317,0.001134366,0.0002143115,0.0005417624,0.0003904821,0.00128292,0.0003449693,0.0002316073],"category_scores_gemma":[0.004386748,0.0006486217,0.0001725831,0.0007765257,0.0108852,0.0005666263,0.001184308,0.001117186,0.00008972352],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001763322,"about_ca_system_score_gemma":0.0003053515,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004682754,"about_ca_topic_score_gemma":0.000002496887,"domain_scores_codex":[0.9943042,0.0001610866,0.001540817,0.0009265766,0.001844004,0.001223271],"domain_scores_gemma":[0.993686,0.002391865,0.0008356774,0.00165526,0.0006958171,0.0007353872],"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.00002193919,0.0009104148,0.000008952763,0.001519111,0.00003663849,0.0000193892,0.001768444,0.00001811922,0.00211974,0.9898264,0.000309391,0.003441436],"study_design_scores_gemma":[0.0005833325,0.0005280884,0.00005913998,0.0009968012,0.0001410198,0.00007475857,0.000111639,0.1934965,0.005585888,0.7978127,0.00007739602,0.0005326885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1765044,0.0001093868,0.8168619,0.000740802,0.003514149,0.0008864549,0.0005283394,0.00009938864,0.0007552299],"genre_scores_gemma":[0.5586445,0.00004406856,0.4408623,0.00006374707,0.0002112499,0.00001372821,0.00001508703,0.00006544279,0.00007983935],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.3821402,"threshold_uncertainty_score":0.9995965,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963014173","doi":"10.46298/dmtcs.635","title":"Sequence variations of the 1-2-3 conjecture and irregularity strength","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Ontario Ministry of Research and Innovation; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Conjecture; Vertex (graph theory); Graph; Upper and lower bounds; Sequence (biology); Weighting; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.007904307775328885,"gpt":0.2112351702253529,"spread":0.203330862450024,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000456288,0.0001307544,0.0001724044,0.00004592482,0.0001792461,0.000126347,0.0005745075,0.00004695511,0.00006382981],"category_scores_gemma":[0.00005498594,0.00007993824,0.00005093602,0.0003923658,0.001981615,0.0001711026,0.0001802961,0.0001377554,0.000008215853],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001152989,"about_ca_system_score_gemma":0.0000175712,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003054517,"about_ca_topic_score_gemma":5.706705e-7,"domain_scores_codex":[0.9990205,0.00004646718,0.0002431723,0.0001715814,0.0002910156,0.0002272422],"domain_scores_gemma":[0.9991466,0.0001803642,0.0000478536,0.0004611205,0.00006895789,0.00009512553],"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":[2.206487e-7,0.00001067697,0.00004815646,0.00006780405,0.000007231225,1.893685e-7,0.0009530612,0.0001525449,0.003104628,0.9950898,0.00001405856,0.0005515942],"study_design_scores_gemma":[0.00005225342,0.0000150164,0.000647294,0.00005819104,0.000009515046,0.00001450259,0.00005829984,0.4664394,0.002634247,0.5299757,0.000006298568,0.00008935005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6165211,0.00003643681,0.3787227,0.0002067855,0.0003261552,0.0003700244,0.0000159675,0.00009936574,0.003701535],"genre_scores_gemma":[0.980316,0.000001892676,0.01960992,0.00002482779,0.00002284972,0.00001089918,5.475239e-7,0.000008680844,0.000004427803],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4662868,"threshold_uncertainty_score":0.7301342,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2952321143","doi":"10.23638/dmtcs-21-3-20","title":"Search-and-Fetch with 2 Robots on a Disk: Wireless and Face-to-Face Communication Models","year":2019,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; McMaster University; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Face (sociological concept); Wireless; Mathematics; Robot; Fetch; Computer science; Artificial intelligence; Telecommunications; Sociology; Geology; Social science","retraction":null,"screen_n_in":null,"score":{"opus":0.01925388875954083,"gpt":0.2693390801155595,"spread":0.2500851913560186,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00137517,0.0002369455,0.0002918618,0.0001967759,0.0003789246,0.0009951339,0.00184279,0.00005146483,0.00001275577],"category_scores_gemma":[0.00002804745,0.0001669825,0.00002952617,0.0008080191,0.001332913,0.000798734,0.001765468,0.0002675494,0.00005672056],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003478009,"about_ca_system_score_gemma":0.00007699693,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003784519,"about_ca_topic_score_gemma":8.712982e-7,"domain_scores_codex":[0.9973952,0.0001372414,0.0002752964,0.0007271445,0.0009363508,0.0005287658],"domain_scores_gemma":[0.9977042,0.000362743,0.00006021404,0.001255217,0.0001827541,0.0004348573],"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.000008856099,0.00005282806,0.00002302794,0.0000380615,0.000005500901,0.000001261742,0.00600694,0.0360368,0.000102759,0.9542358,0.000004860645,0.003483277],"study_design_scores_gemma":[0.0002801031,0.0003469088,0.00008163469,0.0001873033,0.000003484985,0.00001699615,0.0001504081,0.911315,0.0003182008,0.08705945,0.000004445604,0.0002360358],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1073169,0.00001427896,0.8862096,0.002912032,0.00003579018,0.0006344402,0.0000023403,0.0001082795,0.002766291],"genre_scores_gemma":[0.6731232,0.00001841027,0.32647,0.0003268924,0.000005466296,0.00001208566,0.000001110155,0.00001150477,0.00003138163],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8752782,"threshold_uncertainty_score":0.9596099,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2401129216","doi":"10.46298/dmtcs.2971","title":"Product decomposition for surjective 2-block NCCA","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Surjective function; Injective function; Mathematics; Product (mathematics); Block (permutation group theory); Uniqueness; Decomposition; Pure mathematics; Combinatorics; Mathematical analysis; Chemistry; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01964220524179911,"gpt":0.27471379124091,"spread":0.2550715859991109,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001113147,0.000231041,0.0002520964,0.0001621396,0.0005708351,0.0003704811,0.002344387,0.00004255014,0.00002321621],"category_scores_gemma":[0.00008029547,0.0001884394,0.000132865,0.0008644782,0.001219526,0.0006128658,0.0007084826,0.0001219326,0.00007393613],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004394855,"about_ca_system_score_gemma":0.0001030987,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000242019,"about_ca_topic_score_gemma":5.372942e-7,"domain_scores_codex":[0.9976981,0.0000417758,0.0003832151,0.0008297035,0.0004888214,0.0005583992],"domain_scores_gemma":[0.9978749,0.0002313779,0.0001366199,0.001226905,0.0003036199,0.0002265656],"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.000003417945,0.0001602458,0.000006927691,0.00002627295,0.000007882677,0.000001750393,0.002251038,0.000008377341,0.002139643,0.9923922,0.00005587581,0.002946389],"study_design_scores_gemma":[0.0001371582,0.0001194932,0.0001594588,0.00002603187,0.00001272288,0.00004014114,0.00002191479,0.5137432,0.0254743,0.4599746,0.00006460341,0.0002264123],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008903338,0.00001576537,0.9821634,0.000368381,0.000251497,0.0007291197,0.000007527039,0.0003053343,0.007255584],"genre_scores_gemma":[0.5323454,9.734435e-7,0.4674471,0.00007674583,0.00004686321,0.00006304872,0.000002375911,0.000009346946,0.00000821318],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5324176,"threshold_uncertainty_score":0.7684335,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2148592822","doi":"10.46298/dmtcs.2072","title":"Coloring and Guarding Arrangements","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Ministerio de Ciencia e Innovación; European Social Fund; Fonds De La Recherche Scientifique - FNRS; Generalitat de Catalunya; European Commission","keywords":"Hypergraph; Combinatorics; Vertex (graph theory); Chromatic scale; Mathematics; Bounded function; Monochromatic color; Discrete mathematics; Graph; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01412245192297687,"gpt":0.2547450789272973,"spread":0.2406226270043204,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008410607,0.0001651971,0.000176889,0.0001880306,0.0004489041,0.001084529,0.0009739078,0.00003203438,0.00005357437],"category_scores_gemma":[0.00009077661,0.0001351109,0.00004219016,0.0007643828,0.0006828991,0.00113025,0.0009192313,0.000106327,0.00009942055],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002821231,"about_ca_system_score_gemma":0.00004190123,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001819178,"about_ca_topic_score_gemma":1.183297e-7,"domain_scores_codex":[0.9981515,0.00003844883,0.0002852583,0.0005113798,0.0006140074,0.0003993938],"domain_scores_gemma":[0.9988418,0.000222425,0.00007812419,0.0004401594,0.0001940093,0.0002234759],"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":[4.341292e-7,0.00002503882,0.00002687957,0.00001683511,0.000005044323,0.000001523006,0.0006730217,0.0001666516,0.001735398,0.9795534,0.00005218864,0.01774357],"study_design_scores_gemma":[0.0001053497,0.00005349996,0.0004858936,0.00002630912,0.000003488674,0.00001918589,0.00002474363,0.6955106,0.001346423,0.3022365,0.00004338174,0.0001446808],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09232152,0.00002365728,0.9023185,0.0007199582,0.0002885619,0.0002526081,4.910319e-7,0.0001109923,0.003963688],"genre_scores_gemma":[0.604691,0.000002765597,0.3950281,0.00018848,0.00005510776,0.00001608364,5.878242e-7,0.000004346878,0.00001345224],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6953439,"threshold_uncertainty_score":0.9999524,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W34927876","doi":"10.46298/dmtcs.618","title":"Surjective cellular automata far from the Garden of Eden","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"European Regional Development Fund; Academy of Finland","keywords":"Mathematics; Surjective function; Cellular automaton; Garden of Eden; Automaton; Von Neumann architecture; Measure (data warehouse); Discrete mathematics; Dimension (graph theory); Pure mathematics; Algorithm; Theoretical computer science; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01188038645742304,"gpt":0.2374385547649388,"spread":0.2255581683075158,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.002150488,0.0004107993,0.0005831873,0.00013267,0.0004658177,0.0009930064,0.007722107,0.0001021628,0.0002917812],"category_scores_gemma":[0.0004350783,0.0002595561,0.0002358964,0.001294915,0.004284853,0.0008022512,0.004431124,0.0003529538,0.0002628382],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008041257,"about_ca_system_score_gemma":0.0001844012,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000489657,"about_ca_topic_score_gemma":0.000002080782,"domain_scores_codex":[0.9953147,0.0002917654,0.0008043814,0.001114827,0.001654849,0.0008195264],"domain_scores_gemma":[0.9936586,0.002196343,0.00030959,0.002934308,0.0005887143,0.0003124539],"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.000002032478,0.0001848051,0.00005037487,0.00002436548,0.00002869748,0.000006606136,0.005114916,0.0001574117,0.001572869,0.9823087,0.000162548,0.01038666],"study_design_scores_gemma":[0.000150445,0.0001131031,0.0006456387,0.00004166449,0.00001331304,0.000009265443,0.0002089468,0.628412,0.002985646,0.3671543,0.00002623361,0.00023946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02791505,0.00005825204,0.9612042,0.002169555,0.0006127911,0.0007732942,0.00001339584,0.0002755224,0.006977885],"genre_scores_gemma":[0.6158844,0.000002924651,0.3837527,0.0001990608,0.000111862,0.00002318365,0.00000190689,0.00001420806,0.000009741989],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6282546,"threshold_uncertainty_score":0.9999857,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2274875244","doi":"10.46298/dmtcs.2097","title":"Bounding the monomial index and (1,l)-weight choosability of a graph","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"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; Combinatorics; Graph; Vertex (graph theory); Monomial; Upper and lower bounds; Bound graph; Discrete mathematics; Graph power; Line graph","retraction":null,"screen_n_in":null,"score":{"opus":0.0133706421567809,"gpt":0.2796127339591611,"spread":0.2662420918023802,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.004986682,0.0002400689,0.000364179,0.0002251489,0.0006226774,0.000477705,0.003436222,0.00005851116,0.00001337209],"category_scores_gemma":[0.0005834174,0.0001496611,0.0001105441,0.001320767,0.008688982,0.0006342007,0.002121666,0.0003189198,0.000007620607],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000299594,"about_ca_system_score_gemma":0.00007509325,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002243651,"about_ca_topic_score_gemma":7.319349e-7,"domain_scores_codex":[0.9968946,0.0002625563,0.0004909842,0.0007270683,0.0009776931,0.0006471156],"domain_scores_gemma":[0.9961601,0.001567443,0.0001764431,0.001616076,0.0002073918,0.0002725031],"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.000007902026,0.00004596981,0.0002831777,0.00003863606,0.000006799416,7.215529e-7,0.001257109,0.00006178023,0.0004844957,0.9905338,0.000004260617,0.007275331],"study_design_scores_gemma":[0.0001353083,0.00008497322,0.0005275597,0.00002697771,0.000003754709,0.00001336877,0.00002353979,0.4305448,0.001207357,0.5672992,0.00001815734,0.0001149202],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1195686,0.00002154913,0.8772964,0.0006922855,0.0001753621,0.0002844403,0.000001531085,0.00007142496,0.001888402],"genre_scores_gemma":[0.8231796,0.000004511313,0.1766468,0.00009133564,0.00005183605,0.0000129814,2.051125e-7,0.000009648369,0.000003119906],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.703611,"threshold_uncertainty_score":0.9940088,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1593427793","doi":"10.46298/dmtcs.458","title":"Adjoint functors and tree duality","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Digraph; Mathematics; Homomorphism; Duality (order theory); Functor; Combinatorics; Functor category; Tree (set theory); Adjoint functors; Discrete mathematics; Natural transformation","retraction":null,"screen_n_in":null,"score":{"opus":0.02091307619867988,"gpt":0.2992496958744759,"spread":0.278336619675796,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.002189923,0.0003152843,0.0003835018,0.000284267,0.0005437188,0.0007967331,0.002662414,0.00006734752,0.0000299351],"category_scores_gemma":[0.0003257609,0.0002376555,0.0001038428,0.001407618,0.00342398,0.001017751,0.001320923,0.0003243987,0.00004698693],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004760208,"about_ca_system_score_gemma":0.00008883941,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.045418e-7,"about_ca_topic_score_gemma":3.572513e-7,"domain_scores_codex":[0.9962549,0.0001442529,0.0004652952,0.0009960608,0.001233526,0.0009059447],"domain_scores_gemma":[0.9971117,0.0005006522,0.0001155258,0.001496185,0.0002167721,0.0005592068],"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.000005619759,0.00007812053,0.00001557884,0.00001516094,0.000004048661,0.00001383973,0.001053953,0.00001191574,0.001005746,0.9621177,0.00001959868,0.03565867],"study_design_scores_gemma":[0.0001688883,0.0002655297,0.0007033839,0.00003548161,0.000004243921,0.00004825546,0.00003098585,0.2880059,0.00160667,0.708855,0.00003063042,0.0002450395],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02650556,0.00005297447,0.9626805,0.001940616,0.0001593472,0.0002859341,0.000002231368,0.0002652346,0.00810758],"genre_scores_gemma":[0.6465744,0.000007753115,0.3529665,0.0003820439,0.00004167116,0.000004754488,4.981089e-7,0.000007597931,0.00001472481],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6200688,"threshold_uncertainty_score":0.9992881,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}