{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"Vida Dujmović","is_ca":false},{"name":"David R. Wood","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006357593,0.001387374,0.0008110509,0.002215589,0.001109361,0.003377582,0.001549389,0.001210536,0.02077848],"category_scores_gemma":[0.005165785,0.000946846,0.001082411,0.004715735,0.002583633,0.006089083,0.00203685,0.002424189,0.005510546],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002911532,"about_ca_system_score_gemma":0.000637129,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00229078,"about_ca_topic_score_gemma":0.002737717,"domain_scores_codex":[0.998357,0.0004656934,0.0001104138,0.0005016237,0.0003250611,0.0002402372],"domain_scores_gemma":[0.9970797,0.001623288,0.0003337724,0.0004958815,0.0003182188,0.0001491572],"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.00008888345,0.00003993973,0.0003301757,0.0004680509,0.00002349916,0.0001289033,0.0004266658,0.01936581,0.002077309,0.9092414,0.01261909,0.05519026],"study_design_scores_gemma":[0.00002813772,0.00004187106,0.0002932314,0.00006269228,0.00001178226,0.0001865388,0.0001035311,0.01735831,0.000604426,0.9527643,0.02851905,0.00002606071],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0630895,0.01287018,0.7782108,0.003207325,0.0007768021,0.0002035637,0.003689715,0.003071351,0.1348807],"genre_scores_gemma":[0.5054618,0.0182924,0.364336,0.002336007,0.002132411,0.0005696168,0.007847391,0.001360362,0.09766404],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02077848,"threshold_uncertainty_score":0.06951094,"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","authors":[{"name":"Vida Dujmović","is_ca":false},{"name":"David R. Wood","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004332809,0.0005003046,0.0004310883,0.000724116,0.0006886196,0.001646126,0.001020315,0.0004535522,0.005283499],"category_scores_gemma":[0.002373649,0.0006550052,0.000614781,0.001273691,0.001175532,0.002852761,0.001120799,0.0007207968,0.001021359],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001039866,"about_ca_system_score_gemma":0.0007787083,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003771655,"about_ca_topic_score_gemma":0.007016784,"domain_scores_codex":[0.9994295,0.0001153936,0.0000491983,0.0001417663,0.000175635,0.0000884349],"domain_scores_gemma":[0.998386,0.0004452613,0.0002523974,0.0005651205,0.0002222061,0.00012891],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001247952,0.0002021005,0.004699069,0.0005028597,0.00008865271,0.0003220433,0.001659743,0.1779811,0.05689144,0.3361533,0.01310425,0.4071475],"study_design_scores_gemma":[0.000204038,0.0006143892,0.00577981,0.0001330068,0.0001395648,0.0009616051,0.0008814747,0.4426692,0.04206534,0.4093064,0.09708644,0.0001587149],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1687288,0.0009700374,0.8103549,0.0003411662,0.00009721021,0.0001686037,0.0008065322,0.003833518,0.01469929],"genre_scores_gemma":[0.4688771,0.0009459436,0.5103415,0.000137896,0.00007138828,0.0002068967,0.001406498,0.0009675581,0.01704534],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005283499,"threshold_uncertainty_score":0.0176751,"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","authors":[{"name":"R. A. Bailey","is_ca":false},{"name":"Karen Meagher","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001018811,0.0007382287,0.0009048807,0.003180888,0.002029912,0.00308664,0.0007961998,0.0007833738,0.003908481],"category_scores_gemma":[0.004958178,0.0005567325,0.0004981837,0.002726165,0.003856378,0.005021331,0.003020292,0.002672964,0.0006143721],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002161608,"about_ca_system_score_gemma":0.0005320426,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001332536,"about_ca_topic_score_gemma":0.00116596,"domain_scores_codex":[0.9989107,0.0002882581,0.00005748565,0.0002449826,0.0003057482,0.0001928374],"domain_scores_gemma":[0.9966815,0.001723433,0.000320252,0.0003090563,0.0003393563,0.0006264509],"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.00004954235,0.00002025171,0.0008652341,0.00007161283,0.00002050557,0.00005476825,0.0002857079,0.003448491,0.001063144,0.9659951,0.01436807,0.01375751],"study_design_scores_gemma":[0.000009940148,0.00002076012,0.001013488,0.00002959384,0.00001088856,0.00013425,0.0001034278,0.009382323,0.0005261164,0.9712577,0.01748093,0.00003063504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6098542,0.02667216,0.1481914,0.0268255,0.003146063,0.0001217647,0.002183879,0.000562386,0.1824427],"genre_scores_gemma":[0.956033,0.005411256,0.02397506,0.001314468,0.002193384,0.0001187064,0.0006436461,0.0001806438,0.01012979],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003908481,"threshold_uncertainty_score":0.01568365,"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","authors":[{"name":"Vida Dujmović","is_ca":false},{"name":"Attila Pór","is_ca":false},{"name":"David R. Wood","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006399039,0.0007481816,0.0004928788,0.001720555,0.001535847,0.003856857,0.001285089,0.001096933,0.01600104],"category_scores_gemma":[0.005056771,0.0008789984,0.0009729271,0.002662444,0.001887439,0.004190384,0.001720384,0.001307807,0.002589837],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002132983,"about_ca_system_score_gemma":0.0008254081,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001874025,"about_ca_topic_score_gemma":0.002375545,"domain_scores_codex":[0.9985501,0.0002825157,0.0001221111,0.0004375335,0.0003605559,0.0002471508],"domain_scores_gemma":[0.9969786,0.00104092,0.0005009106,0.0007595821,0.0004907997,0.0002291086],"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.0001360229,0.0000368636,0.0006576597,0.0002229113,0.00002719358,0.0001466743,0.0003313489,0.03607175,0.009067875,0.8757959,0.007373333,0.07013237],"study_design_scores_gemma":[0.00008117419,0.0001457837,0.000891696,0.00009220057,0.00003921178,0.0006010346,0.000271741,0.08228307,0.008322716,0.8135882,0.09361812,0.00006504484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05128995,0.001059216,0.901528,0.0005149958,0.0003132195,0.0001885997,0.001725213,0.002295206,0.04108568],"genre_scores_gemma":[0.4427691,0.001806291,0.5143231,0.0004115748,0.0002983797,0.0003063354,0.002537189,0.001012358,0.0365356],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01600104,"threshold_uncertainty_score":0.05352885,"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","authors":[{"name":"Jean‐Paul Allouche","is_ca":false},{"name":"Jeffrey Shallit","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005151898,0.000423517,0.0003978435,0.001201302,0.001280477,0.001642515,0.0005271736,0.000459914,0.003328187],"category_scores_gemma":[0.002241176,0.0004867372,0.0004872495,0.0006441876,0.002483839,0.002696444,0.00224979,0.0008636506,0.0006988239],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003525977,"about_ca_system_score_gemma":0.0002918522,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002966057,"about_ca_topic_score_gemma":0.0003735163,"domain_scores_codex":[0.9991967,0.0001162906,0.0001032026,0.0002208517,0.0002049284,0.0001581104],"domain_scores_gemma":[0.9984376,0.00073154,0.0002922154,0.0002008934,0.0001525844,0.0001851529],"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.0003483384,0.0000550573,0.002325823,0.0001523321,0.00002232703,0.001097595,0.001438145,0.002203231,0.01820686,0.9378793,0.001233946,0.03503713],"study_design_scores_gemma":[0.00003603711,0.0001689716,0.001573671,0.0000602119,0.0000377999,0.001672228,0.0004796817,0.007864724,0.01326601,0.9611611,0.01362272,0.00005665941],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.820321,0.001854072,0.1181436,0.000502483,0.0002425767,0.00004055693,0.0002430653,0.0004618402,0.05819061],"genre_scores_gemma":[0.967208,0.0004175269,0.02062307,0.0001537361,0.0002054006,0.00006595086,0.0002234871,0.0001052504,0.01099761],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003328187,"threshold_uncertainty_score":0.01113385,"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","authors":[{"name":"Bill Rosgen","is_ca":true},{"name":"Lorna Stewart","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00196497,0.001427969,0.00183868,0.002776378,0.001996777,0.004920993,0.002838338,0.001805972,0.01226123],"category_scores_gemma":[0.01548773,0.0009060554,0.002106688,0.004319302,0.003365773,0.01144316,0.003206899,0.004568535,0.001117836],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004281332,"about_ca_system_score_gemma":0.001588178,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004427579,"about_ca_topic_score_gemma":0.004026035,"domain_scores_codex":[0.9961817,0.0008807333,0.000169558,0.0009299502,0.001206725,0.0006312281],"domain_scores_gemma":[0.9607934,0.03177384,0.001701388,0.00346099,0.001171375,0.001099034],"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.0006198401,0.0004908707,0.00566614,0.001449674,0.0003051058,0.0003403838,0.0008994428,0.1752704,0.005424528,0.7130973,0.033927,0.06250943],"study_design_scores_gemma":[0.00007168805,0.00003889539,0.001812647,0.00005337961,0.00006723899,0.0002317723,0.000132565,0.1470051,0.0008671852,0.841723,0.007967737,0.00002876332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2884974,0.01569984,0.5503227,0.01962795,0.0005275749,0.000461565,0.00560249,0.001746694,0.1175138],"genre_scores_gemma":[0.8385013,0.007654346,0.1222677,0.001895971,0.002088385,0.0005555492,0.005973315,0.0007982327,0.02026516],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01226123,"threshold_uncertainty_score":0.04101795,"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","authors":[{"name":"Jarosław Grytczuk","is_ca":false},{"name":"H. A. Kierstead","is_ca":false},{"name":"Paweł Prałat","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001800558,0.0006653069,0.0007254076,0.001303986,0.0009975615,0.002281645,0.001721451,0.001279938,0.008151552],"category_scores_gemma":[0.01425623,0.0005600082,0.0007046501,0.0009631283,0.002479057,0.008664584,0.001803949,0.002086703,0.0005118047],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002036599,"about_ca_system_score_gemma":0.0006133368,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007034735,"about_ca_topic_score_gemma":0.0007739352,"domain_scores_codex":[0.9982741,0.0007972216,0.0000645021,0.0003257879,0.0003394884,0.0001989404],"domain_scores_gemma":[0.9914944,0.005466744,0.00123627,0.0008581347,0.0003905313,0.0005538735],"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.0001940763,0.000111885,0.001904361,0.0001305872,0.00003323434,0.00008832049,0.0003786627,0.05274135,0.002548305,0.9252027,0.002853047,0.01381346],"study_design_scores_gemma":[0.00003050743,0.00006474259,0.0005736937,0.00002977999,0.00001157794,0.0001631652,0.0001410793,0.162359,0.001214383,0.8330035,0.002387939,0.00002070158],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6520419,0.001605875,0.2890411,0.001764576,0.00008963326,0.0001480535,0.0004155631,0.000478822,0.0544144],"genre_scores_gemma":[0.9499629,0.0005218043,0.04118671,0.0001844655,0.0001067872,0.0001656166,0.0002120358,0.0001098346,0.007549871],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008151552,"threshold_uncertainty_score":0.02726966,"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","authors":[{"name":"Thérèse Biedl","is_ca":false},{"name":"Michal Stern","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004344733,0.0006542132,0.0006248221,0.001320352,0.001619049,0.001763152,0.001107263,0.0007838596,0.008464288],"category_scores_gemma":[0.004224874,0.0005469293,0.0007947558,0.00272351,0.001788663,0.004731258,0.002028582,0.001639516,0.000726562],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001095731,"about_ca_system_score_gemma":0.0004781928,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002737728,"about_ca_topic_score_gemma":0.001783097,"domain_scores_codex":[0.9991357,0.0002571422,0.00004410754,0.0002059523,0.0001750778,0.000182126],"domain_scores_gemma":[0.9967772,0.001614599,0.000594456,0.0004216369,0.0003477962,0.0002442047],"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.0005155268,0.0001569319,0.003025627,0.0002669876,0.00005509679,0.0005985562,0.001296134,0.08346001,0.007039092,0.8434125,0.005199199,0.0549744],"study_design_scores_gemma":[0.00005964373,0.0001145915,0.001808299,0.0001213845,0.00004777422,0.0005276409,0.0009068626,0.115333,0.003285448,0.8621261,0.01562504,0.00004418831],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.605355,0.0006475612,0.3356128,0.001042402,0.00008236698,0.0001772544,0.001216736,0.0006021538,0.05526385],"genre_scores_gemma":[0.8896769,0.0009407453,0.097679,0.000363979,0.00007808508,0.0002018616,0.001933689,0.0002560695,0.008869625],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008464288,"threshold_uncertainty_score":0.02831584,"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","authors":[{"name":"Omer Angel","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001027335,0.0004869405,0.0005655535,0.001080947,0.0008551613,0.001539078,0.0008270655,0.001391931,0.005805919],"category_scores_gemma":[0.005491477,0.0002441841,0.000593406,0.0009892997,0.003003759,0.002883935,0.001200152,0.001425823,0.0008401201],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009914718,"about_ca_system_score_gemma":0.0008620732,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002438921,"about_ca_topic_score_gemma":0.001568306,"domain_scores_codex":[0.9991195,0.0003189827,0.00003390387,0.0001418565,0.0002373149,0.0001484944],"domain_scores_gemma":[0.9975049,0.001291324,0.0003794181,0.0003116939,0.0002507631,0.0002619062],"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.000009280883,0.00000545775,0.00009712105,0.0000105555,0.000002813842,0.00004916624,0.00003113482,0.004454267,0.0001190807,0.9925957,0.0006543385,0.001971118],"study_design_scores_gemma":[0.000008361649,0.00000826916,0.00009302832,0.000007744175,0.000002451954,0.00006239804,0.00001278074,0.02386112,0.00007245758,0.9723529,0.003510158,0.000008387125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2124671,0.008144046,0.5971152,0.007253959,0.001157868,0.0001790625,0.0008900998,0.0005742479,0.1722184],"genre_scores_gemma":[0.9249133,0.003182588,0.03607895,0.001039276,0.0009028971,0.000265723,0.0004620255,0.0001272242,0.0330279],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005805919,"threshold_uncertainty_score":0.01942271,"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","authors":[{"name":"Andrew D. King","is_ca":true},{"name":"Bruce Reed","is_ca":true},{"name":"Adrian Vetta","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001135314,0.00118404,0.001027022,0.002196097,0.001971829,0.003195299,0.002966189,0.001851566,0.01878545],"category_scores_gemma":[0.008318988,0.0008146635,0.001023247,0.002186809,0.002679369,0.006995245,0.002542398,0.003915951,0.003208886],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002980364,"about_ca_system_score_gemma":0.001071303,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003884462,"about_ca_topic_score_gemma":0.004880913,"domain_scores_codex":[0.997892,0.0002501184,0.00006208343,0.0007535231,0.0005080071,0.0005343299],"domain_scores_gemma":[0.9887602,0.007337002,0.000607557,0.001943906,0.0007711101,0.0005802618],"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.002522701,0.0006336932,0.01030843,0.0009871166,0.0002144455,0.0008583572,0.001235591,0.1783357,0.1229757,0.4614407,0.03680919,0.1836786],"study_design_scores_gemma":[0.0002098888,0.0004520201,0.005549655,0.0002392698,0.0001569079,0.001094916,0.0002398132,0.5081664,0.04689321,0.3885009,0.04831376,0.0001832497],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2489685,0.004535913,0.6302558,0.004838462,0.0003601855,0.0002143477,0.00158647,0.006031132,0.1032091],"genre_scores_gemma":[0.811545,0.001978766,0.1621057,0.001163707,0.0004196732,0.0003483167,0.001599615,0.001006219,0.01983291],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01878545,"threshold_uncertainty_score":0.06284356,"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","authors":[{"name":"Shigeki Akiyama","is_ca":true},{"name":"Nertila Gjini","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015987,0.0001985228,0.0002908117,0.00119844,0.0009689401,0.001586585,0.0003779999,0.0004265991,0.004896394],"category_scores_gemma":[0.001765299,0.0002562799,0.0003259839,0.0006163717,0.001789075,0.00105529,0.001011359,0.0004399721,0.0004064158],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004422828,"about_ca_system_score_gemma":0.0001627438,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002898915,"about_ca_topic_score_gemma":0.000280597,"domain_scores_codex":[0.9997713,0.0000336665,0.00001934426,0.00007949796,0.0000522909,0.00004390478],"domain_scores_gemma":[0.9991964,0.0002957019,0.0001667952,0.0001245053,0.00008334786,0.0001332757],"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.0001597239,0.00002841812,0.005123049,0.00009681258,0.00001744531,0.0004713926,0.000945357,0.0131979,0.01185948,0.9543354,0.0007212926,0.01304361],"study_design_scores_gemma":[0.00005233319,0.00009771161,0.00467085,0.00005037559,0.00002406687,0.0008331682,0.0005482766,0.04374949,0.008109802,0.9332961,0.008537469,0.00003036477],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9561337,0.0002088617,0.02304808,0.0001127727,0.00002578159,0.00002026745,0.0001646093,0.0001119891,0.02017404],"genre_scores_gemma":[0.9929088,0.00009877209,0.004307718,0.00002143346,0.00001923524,0.00003328016,0.0002473994,0.00002591078,0.002337291],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004896394,"threshold_uncertainty_score":0.01638007,"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","authors":[{"name":"Andrew R. Curtis","is_ca":true},{"name":"Min Chih Lin","is_ca":false},{"name":"Ross M. McConnell","is_ca":false},{"name":"Yahav Nussbaum","is_ca":false},{"name":"Francisco J. Soulignac","is_ca":false},{"name":"Jeremy Spinrad","is_ca":false},{"name":"Jayme L. Szwarcfiter","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008339579,0.0004020096,0.0004183528,0.0009155946,0.0009768783,0.001508026,0.0009936539,0.0006558847,0.006773895],"category_scores_gemma":[0.006993466,0.0004180653,0.0006467476,0.001096211,0.001499716,0.003880543,0.00231709,0.001217954,0.0007246079],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009854978,"about_ca_system_score_gemma":0.001111595,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001457395,"about_ca_topic_score_gemma":0.001381165,"domain_scores_codex":[0.9983813,0.0003205302,0.0001142976,0.0005696888,0.0003756814,0.0002385124],"domain_scores_gemma":[0.9921054,0.003222799,0.0007475367,0.002691964,0.0008852088,0.0003470998],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001301756,0.0004933766,0.01444215,0.0003693477,0.0001277696,0.000554594,0.001357142,0.03653876,0.04142115,0.436698,0.01109429,0.4556017],"study_design_scores_gemma":[0.0001543048,0.0002140783,0.003907041,0.0000345027,0.00006781062,0.0007362862,0.0005745786,0.1972909,0.05345195,0.7296635,0.01381855,0.0000864495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2740347,0.0001304694,0.7078245,0.000634542,0.00006424086,0.0002369876,0.000454688,0.002474409,0.01414543],"genre_scores_gemma":[0.8287872,0.00007185645,0.1654652,0.0001553725,0.00003669921,0.0001124527,0.0010179,0.0002817845,0.004071601],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006773895,"threshold_uncertainty_score":0.02266091,"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","authors":[{"name":"Iiro Honkala","is_ca":true},{"name":"Tero Laihonen","is_ca":true},{"name":"Sanna Ranto","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001059131,0.0008303821,0.0004986022,0.001887597,0.001116333,0.001288161,0.0008629836,0.001215525,0.001540958],"category_scores_gemma":[0.007926324,0.0003263427,0.0004336065,0.002234682,0.00272328,0.002883888,0.002228548,0.001463966,0.0004320734],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009894359,"about_ca_system_score_gemma":0.0006006769,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001048994,"about_ca_topic_score_gemma":0.0008809675,"domain_scores_codex":[0.9989421,0.0003435135,0.00007125185,0.000143902,0.0003071352,0.0001922304],"domain_scores_gemma":[0.9936944,0.004062783,0.0006190005,0.0005068645,0.0007955806,0.0003213208],"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.0001024703,0.00002635316,0.0006118035,0.00009771106,0.000009346013,0.0002422425,0.0005282741,0.05052221,0.003650294,0.9192528,0.001111167,0.02384534],"study_design_scores_gemma":[0.00002748886,0.0001154412,0.000277148,0.00006244064,0.000012473,0.0003579779,0.0002372957,0.1492243,0.003977756,0.8411881,0.004476205,0.00004345801],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2865155,0.001533155,0.6896958,0.0007965676,0.0002371978,0.00008465679,0.0001794813,0.0001691087,0.02078851],"genre_scores_gemma":[0.8652574,0.002191858,0.120476,0.0003069274,0.0003211205,0.0001584225,0.0002466955,0.00009964607,0.01094205],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001887597,"threshold_uncertainty_score":0.007178903,"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","authors":[{"name":"Manuel Kauers","is_ca":false},{"name":"Rika Yatchak","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002121433,0.0002677122,0.000406458,0.0007894126,0.0006767465,0.001123377,0.0005949872,0.0006513154,0.003258399],"category_scores_gemma":[0.001045952,0.0002063249,0.0006311905,0.0006350829,0.0008352307,0.00131878,0.0005336928,0.0005854997,0.0003875629],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005081769,"about_ca_system_score_gemma":0.0002869958,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00183449,"about_ca_topic_score_gemma":0.001387437,"domain_scores_codex":[0.9998141,0.00003250995,0.00001071386,0.00004235602,0.00004431061,0.00005595103],"domain_scores_gemma":[0.9994105,0.000174497,0.0001157308,0.000161367,0.00005697249,0.00008094814],"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.0004248276,0.0001269093,0.01151437,0.0001073003,0.00004136484,0.0006751318,0.0005282036,0.1178171,0.02023938,0.8198931,0.001777952,0.02685435],"study_design_scores_gemma":[0.00004334737,0.0001062303,0.003372849,0.00002976872,0.00001496998,0.0005694191,0.0002927213,0.4731001,0.004845916,0.5125428,0.005043156,0.00003870152],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9364893,0.0001933407,0.05191927,0.0001737976,0.00002713691,0.00001675207,0.0001506331,0.0001105853,0.01091926],"genre_scores_gemma":[0.987233,0.0001319335,0.009692888,0.00003594369,0.000009918622,0.00001796973,0.0001689871,0.00002190774,0.002687526],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003258399,"threshold_uncertainty_score":0.01090044,"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)","authors":[{"name":"Guy Fayolle","is_ca":false},{"name":"Kilian Raschel","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002087688,0.0007945237,0.001008811,0.003702821,0.001170886,0.002418662,0.002483642,0.001277763,0.004375647],"category_scores_gemma":[0.01902941,0.0005286756,0.0008971504,0.002243308,0.003073959,0.006692711,0.001789436,0.002422334,0.0007738913],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00178895,"about_ca_system_score_gemma":0.0006604896,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002096949,"about_ca_topic_score_gemma":0.001601008,"domain_scores_codex":[0.9988839,0.0003468035,0.00006470187,0.0001646381,0.0003655588,0.0001744703],"domain_scores_gemma":[0.9948979,0.002872704,0.0005469283,0.0005315275,0.0007393519,0.0004116326],"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.00007404229,0.00007165223,0.001691344,0.0001864386,0.00002249007,0.0002233311,0.0002528522,0.02112237,0.002771068,0.9572909,0.002109058,0.01418449],"study_design_scores_gemma":[0.00001355036,0.0000283831,0.001189221,0.00007239292,0.00001600837,0.0002209217,0.0001084667,0.2175016,0.001184468,0.7782569,0.001374709,0.00003334852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.497471,0.005071937,0.4386134,0.002456055,0.0003359234,0.0000708702,0.0005734667,0.001190391,0.05421696],"genre_scores_gemma":[0.9448342,0.002159114,0.04191585,0.0005069904,0.0005079727,0.0001766415,0.0007346556,0.0003745036,0.00878999],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004375647,"threshold_uncertainty_score":0.01463795,"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","authors":[{"name":"Mahdad Khatirinejad","is_ca":false},{"name":"Reza Naserasr","is_ca":false},{"name":"Mike Newman","is_ca":false},{"name":"Ben Seamone","is_ca":false},{"name":"Brett Stevens","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001361615,0.0006128215,0.0008508044,0.001284212,0.0009313182,0.001721094,0.001651613,0.0010007,0.003955167],"category_scores_gemma":[0.006637113,0.0005259369,0.0007489256,0.002447308,0.001479963,0.003749114,0.002201815,0.001236708,0.000624681],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001497783,"about_ca_system_score_gemma":0.0008294482,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001814014,"about_ca_topic_score_gemma":0.002860682,"domain_scores_codex":[0.9987447,0.0003661553,0.0001091412,0.0003479295,0.0002516458,0.0001802886],"domain_scores_gemma":[0.9957799,0.001604504,0.000372114,0.001579957,0.0003482238,0.0003153495],"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.0006259053,0.000542231,0.007271494,0.0003910955,0.0001268638,0.0001658177,0.0008214383,0.1117384,0.03105934,0.4670552,0.01031976,0.3698824],"study_design_scores_gemma":[0.0001068445,0.0001637135,0.001277628,0.0000472527,0.00008018071,0.0002534874,0.0002034323,0.3568762,0.01526793,0.6147336,0.0109446,0.00004511951],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2161253,0.0002479668,0.7709609,0.0006161862,0.00009560773,0.0002615801,0.0003335164,0.001334802,0.01002416],"genre_scores_gemma":[0.4361116,0.0001545761,0.5551867,0.0002001003,0.00005127595,0.0001880739,0.0006807737,0.0002737482,0.007153206],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003955167,"threshold_uncertainty_score":0.01323134,"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","authors":[{"name":"Ehsan Chiniforooshan","is_ca":false},{"name":"Vašek Chvátal","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002552612,0.001033367,0.001122143,0.002334145,0.003135699,0.003300092,0.001456678,0.001520887,0.008970855],"category_scores_gemma":[0.01034661,0.0006779708,0.00131527,0.002446977,0.006412222,0.008400075,0.003825281,0.00372028,0.001522082],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002568455,"about_ca_system_score_gemma":0.0007494186,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001634217,"about_ca_topic_score_gemma":0.001064187,"domain_scores_codex":[0.9978707,0.0005201913,0.0001234855,0.0005828006,0.00059102,0.0003118382],"domain_scores_gemma":[0.9914035,0.005038842,0.0006232891,0.001247341,0.001040433,0.0006466763],"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.00003116868,0.00001350432,0.0002630661,0.00005500826,0.00001215928,0.00007485568,0.0001009545,0.002501665,0.0005513467,0.98458,0.003528506,0.008287678],"study_design_scores_gemma":[0.00001365557,0.00001806082,0.0002325724,0.00001870916,0.000006348431,0.0001321928,0.00005911948,0.002415726,0.0005390398,0.9790141,0.01753643,0.00001397486],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1688411,0.01726953,0.4894622,0.02146052,0.001760418,0.0001333638,0.001511588,0.0005605156,0.2990008],"genre_scores_gemma":[0.8494344,0.007989572,0.09969607,0.001930498,0.001171147,0.0002258523,0.0008163953,0.0002149393,0.03852108],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008970855,"threshold_uncertainty_score":0.03001052,"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","authors":[{"name":"Peter Bella","is_ca":false},{"name":"Daniel Král͏̌","is_ca":false},{"name":"Bojan Mohar","is_ca":true},{"name":"Katarina Quittnerová","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000668009,0.0005918739,0.000673418,0.0008164365,0.002064006,0.002004188,0.001146922,0.001696213,0.0116193],"category_scores_gemma":[0.005574303,0.0005549698,0.0006140735,0.001247462,0.001783184,0.003995833,0.002892036,0.001613295,0.00193044],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00159618,"about_ca_system_score_gemma":0.001092874,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001785811,"about_ca_topic_score_gemma":0.00226697,"domain_scores_codex":[0.9988513,0.0002093092,0.0000768037,0.0003524179,0.0002170611,0.0002931389],"domain_scores_gemma":[0.9959953,0.001845795,0.0005740429,0.0008007768,0.0004262134,0.0003578454],"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.002818278,0.0005832088,0.01571137,0.0008783603,0.00008400958,0.0009111083,0.001926546,0.04385214,0.08198529,0.6538177,0.03134408,0.1660879],"study_design_scores_gemma":[0.0005468076,0.001011361,0.006758106,0.0001567643,0.0001673507,0.00172257,0.00269179,0.1127541,0.08028415,0.7266631,0.06700201,0.0002419686],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7959768,0.0004592407,0.1260659,0.003952834,0.0002580177,0.000190215,0.001925713,0.001560007,0.06961118],"genre_scores_gemma":[0.9171354,0.0003458411,0.06949566,0.0008953508,0.00007949552,0.0001569274,0.001898829,0.0002156667,0.009776853],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0116193,"threshold_uncertainty_score":0.03887045,"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","authors":[{"name":"David Bryant","is_ca":false},{"name":"Paul Tupper","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005673114,0.0007441753,0.0008682436,0.00260262,0.001589568,0.004870206,0.0006524847,0.0008945177,0.005440243],"category_scores_gemma":[0.003656527,0.0006402194,0.0005735218,0.002417743,0.003420982,0.004749805,0.003708431,0.002430093,0.0007661106],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001982267,"about_ca_system_score_gemma":0.0003356359,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008603308,"about_ca_topic_score_gemma":0.0006024767,"domain_scores_codex":[0.9992224,0.0002321848,0.00003604504,0.000219619,0.0002227714,0.00006690648],"domain_scores_gemma":[0.99766,0.0009849282,0.0005569095,0.0001581756,0.000213662,0.0004261749],"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.00003486746,0.00001401221,0.001350463,0.00006758602,0.00002416122,0.0001319706,0.000218736,0.008132986,0.0007429207,0.9712973,0.003773374,0.01421165],"study_design_scores_gemma":[0.000005842695,0.00002995946,0.0009665018,0.00003164042,0.00001055075,0.0002863906,0.0001449726,0.01202648,0.0002627,0.9757117,0.01050918,0.00001411928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6609171,0.01567649,0.1841841,0.00891033,0.001090278,0.00009525003,0.001316581,0.0003738273,0.127436],"genre_scores_gemma":[0.9632854,0.005086818,0.01497924,0.0004637362,0.001356641,0.00009049089,0.0006060073,0.0001275336,0.01400413],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005440243,"threshold_uncertainty_score":0.01819938,"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","authors":[{"name":"Tomáš Kaiser","is_ca":true},{"name":"Riste Škrekovski","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002370652,0.0004932316,0.0004411965,0.0006693929,0.0009681751,0.001238157,0.000878627,0.0007287636,0.005038797],"category_scores_gemma":[0.002389895,0.0004493122,0.0005942191,0.0008564921,0.00100153,0.002107619,0.001257492,0.0008889087,0.0004021492],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008956895,"about_ca_system_score_gemma":0.0005669151,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003843882,"about_ca_topic_score_gemma":0.00567827,"domain_scores_codex":[0.9995255,0.00004328698,0.00001868452,0.000153978,0.0001267914,0.0001317373],"domain_scores_gemma":[0.9984714,0.0005975002,0.000333722,0.0002315251,0.0001744127,0.0001913495],"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.0009168399,0.0001629108,0.01460575,0.0006448099,0.0001454949,0.001638612,0.001333487,0.07156582,0.05632048,0.7574481,0.008520603,0.08669714],"study_design_scores_gemma":[0.0001458636,0.0003893232,0.00945159,0.0002222491,0.0002175212,0.002866565,0.001484275,0.1982823,0.05835463,0.6547613,0.07372448,0.00009998055],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8221906,0.0005790451,0.1433348,0.0005060586,0.00007483074,0.00007981896,0.0006718133,0.00028781,0.0322753],"genre_scores_gemma":[0.9444625,0.0003942769,0.04758283,0.0001588724,0.00003148179,0.00006145112,0.0008488423,0.00007559424,0.006384144],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005038797,"threshold_uncertainty_score":0.01685643,"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","authors":[{"name":"Johan Wästlund","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003054033,0.0009190272,0.001233598,0.001497683,0.002042425,0.002152622,0.002566084,0.002164199,0.01016636],"category_scores_gemma":[0.01779126,0.0005290995,0.001189679,0.002536924,0.003123763,0.009223592,0.003086969,0.003629244,0.00133962],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001915533,"about_ca_system_score_gemma":0.001117562,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001224492,"about_ca_topic_score_gemma":0.0008619193,"domain_scores_codex":[0.9962361,0.001926924,0.0001213138,0.0007336675,0.000652027,0.0003300885],"domain_scores_gemma":[0.9894499,0.008148342,0.0007477553,0.0007060867,0.0005180422,0.0004297256],"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.00003251808,0.00003377677,0.0001176788,0.00009189766,0.00001426766,0.00005896524,0.00009778314,0.01324275,0.0001819253,0.9731559,0.002677313,0.0102953],"study_design_scores_gemma":[0.00001985962,0.00001789254,0.00005391602,0.00001498734,0.000005156779,0.00006269757,0.00003471197,0.02951582,0.0001563809,0.9663603,0.003749557,0.000008901393],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06921273,0.002912615,0.8623867,0.006590236,0.0004872667,0.0001724662,0.0004249149,0.000347087,0.05746599],"genre_scores_gemma":[0.760052,0.005166281,0.1927963,0.001498809,0.001671655,0.0007165945,0.0008819468,0.0003175084,0.0368989],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01016636,"threshold_uncertainty_score":0.03400981,"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","authors":[{"name":"James Haglund","is_ca":false},{"name":"Sarah Mason","is_ca":false},{"name":"Kurt Luoto","is_ca":false},{"name":"Steph van Willigenburg","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001011293,0.0006029719,0.000518598,0.001418003,0.001036602,0.001806229,0.0007613425,0.0004359531,0.008624887],"category_scores_gemma":[0.00138391,0.0002726226,0.0006796417,0.0006217248,0.001744361,0.002712995,0.001044145,0.001261426,0.00188651],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008120168,"about_ca_system_score_gemma":0.0007687103,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006167067,"about_ca_topic_score_gemma":0.0007609222,"domain_scores_codex":[0.9992363,0.0001396386,0.00003735176,0.0001084073,0.000309947,0.00016828],"domain_scores_gemma":[0.9991581,0.0001299954,0.0001007347,0.0001412829,0.0003255706,0.0001443061],"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.00001752355,0.00001372331,0.0001593192,0.00002605499,0.000003222245,0.00006338651,0.00009297854,0.0006352597,0.00408665,0.9838923,0.0006804172,0.01032913],"study_design_scores_gemma":[0.00001502391,0.00008693758,0.0005113581,0.0000270795,0.000009105242,0.00044196,0.0001745643,0.01935029,0.01047199,0.9407092,0.02816524,0.00003728922],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2586115,0.001022073,0.6290477,0.0008055442,0.0007650961,0.0001720161,0.000445288,0.0004955809,0.1086352],"genre_scores_gemma":[0.8234786,0.001077439,0.1295799,0.0005921648,0.0006521874,0.0001578009,0.0004918905,0.0003126443,0.04365735],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008624887,"threshold_uncertainty_score":0.02885312,"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","authors":[{"name":"Niklas Eriksen","is_ca":false},{"name":"Ragnar Freij-Hollanti","is_ca":false},{"name":"Johan Wästlund","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004849032,0.0004111512,0.0004969207,0.001652928,0.0008817338,0.001071614,0.001145597,0.0006733901,0.00503911],"category_scores_gemma":[0.003754732,0.0002818456,0.0005434442,0.001748757,0.0009955519,0.001985745,0.001124972,0.0008648934,0.0009612802],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006316563,"about_ca_system_score_gemma":0.0004589201,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006956865,"about_ca_topic_score_gemma":0.0009681068,"domain_scores_codex":[0.9992456,0.000100596,0.00005981044,0.0001798553,0.0002201839,0.0001939896],"domain_scores_gemma":[0.9976075,0.0008996723,0.0004376189,0.0005138466,0.0003354942,0.000205899],"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.0007020364,0.0002246515,0.05508623,0.0002987453,0.00009196961,0.001715493,0.001384396,0.03856151,0.04940695,0.6777284,0.003787757,0.1710117],"study_design_scores_gemma":[0.00006573225,0.0003966544,0.01803126,0.0001254405,0.0001207011,0.00291015,0.0007595284,0.1400513,0.05463247,0.7552119,0.02754763,0.0001472263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8489928,0.0002593914,0.1294832,0.0001520483,0.00007240382,0.000062921,0.0009423203,0.0003805374,0.01965432],"genre_scores_gemma":[0.9575949,0.0002072338,0.03436403,0.0000526488,0.00002477664,0.00007864499,0.0009872424,0.0001099493,0.006580514],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00503911,"threshold_uncertainty_score":0.01685745,"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","authors":[{"name":"In-Jee Jeong","is_ca":true},{"name":"Gregg Musiker","is_ca":false},{"name":"Sicong Zhang","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000634435,0.0006955476,0.0005845008,0.001378326,0.00175127,0.002520927,0.0009226499,0.001332548,0.01068589],"category_scores_gemma":[0.0023201,0.0002922578,0.0007555471,0.00105417,0.002790862,0.004245607,0.001737355,0.00171002,0.001388724],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008275451,"about_ca_system_score_gemma":0.0004857567,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006692455,"about_ca_topic_score_gemma":0.0007072308,"domain_scores_codex":[0.9994977,0.0001215657,0.00003064051,0.00009511466,0.0001232521,0.0001317975],"domain_scores_gemma":[0.9992715,0.0001661382,0.0001617871,0.00008615439,0.0001069499,0.0002075578],"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.000008318342,0.000005282178,0.00006092969,0.000009662329,0.00000136244,0.00005725835,0.00006767374,0.0005999917,0.0003874595,0.997764,0.0002048005,0.0008334065],"study_design_scores_gemma":[0.00001047752,0.00002170335,0.0001026149,0.00001299877,0.000003331473,0.0001710388,0.0001800424,0.004819014,0.0006521465,0.9910151,0.002997881,0.00001355549],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5923878,0.001794338,0.1918066,0.002199703,0.0008243656,0.0001436757,0.0003644193,0.000400674,0.2100784],"genre_scores_gemma":[0.9527918,0.0005988817,0.02220884,0.0003140998,0.000259218,0.00007584944,0.0001923046,0.0001067237,0.02345228],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01068589,"threshold_uncertainty_score":0.03574789,"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","authors":[{"name":"Bruce Reed","is_ca":true},{"name":"David R. Wood","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006291653,0.001417148,0.001199762,0.001032878,0.001646016,0.001530814,0.001818661,0.001199754,0.005450875],"category_scores_gemma":[0.003233768,0.0009246749,0.001504307,0.00139965,0.001232069,0.004326195,0.003911175,0.00197305,0.00224484],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001290942,"about_ca_system_score_gemma":0.001489295,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003360412,"about_ca_topic_score_gemma":0.005551683,"domain_scores_codex":[0.999121,0.0001242614,0.00005647041,0.0003097047,0.0001800944,0.0002084494],"domain_scores_gemma":[0.9974916,0.001079151,0.0002797507,0.0006129578,0.0002317671,0.0003047864],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.007461011,0.00129674,0.006837225,0.001907531,0.0003731285,0.001679052,0.003240391,0.1603206,0.1980848,0.1638309,0.04349008,0.4114786],"study_design_scores_gemma":[0.0006869351,0.0008396254,0.001828097,0.00009110683,0.0002168418,0.001131004,0.0006410708,0.5354088,0.06855833,0.3656575,0.02482109,0.0001196726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3712636,0.0005651825,0.6096836,0.001565019,0.000125615,0.0004001238,0.001484974,0.006518796,0.008393069],"genre_scores_gemma":[0.4606038,0.0002984753,0.5210889,0.0004575898,0.00008571088,0.0002632432,0.004011476,0.0009086931,0.01228208],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005450875,"threshold_uncertainty_score":0.01823497,"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","authors":[{"name":"Olivier Bernardi","is_ca":false},{"name":"Mireille Bousquet‐Mélou","is_ca":false},{"name":"Kilian Raschel","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007080089,0.0006041863,0.0006250899,0.003121084,0.0008859239,0.002077977,0.00129882,0.0006326362,0.01509678],"category_scores_gemma":[0.003240775,0.0003298485,0.001187469,0.001448306,0.001534229,0.002292703,0.001603248,0.001296147,0.002004011],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001282601,"about_ca_system_score_gemma":0.0006826856,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002915428,"about_ca_topic_score_gemma":0.004173006,"domain_scores_codex":[0.9994919,0.0001474642,0.00002500775,0.00008788425,0.0001568104,0.00009093596],"domain_scores_gemma":[0.9992546,0.0002684487,0.00008098663,0.0001302804,0.0001721099,0.0000935226],"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.00001531005,0.00001597853,0.000285465,0.00002976529,0.000006708527,0.00005436667,0.00006247548,0.005409975,0.0006976217,0.9791977,0.002102375,0.01212218],"study_design_scores_gemma":[0.000009149111,0.00002595104,0.0001709992,0.00003016647,0.000009483026,0.0001517785,0.00005072465,0.1786053,0.001306403,0.8121624,0.007456297,0.00002127979],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0609184,0.0004976863,0.8747864,0.0005058885,0.0003069279,0.0001031423,0.0003537617,0.0006507419,0.06187706],"genre_scores_gemma":[0.6930454,0.0007844422,0.2659382,0.00040869,0.0003669722,0.0002864181,0.0008576207,0.0007499745,0.03756225],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01509678,"threshold_uncertainty_score":0.05050379,"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","authors":[{"name":"Jurek Czyzowicz","is_ca":false},{"name":"Konstantinos Georgiou","is_ca":false},{"name":"Evangelos Kranakis","is_ca":false},{"name":"Lata Narayanan","is_ca":false},{"name":"Jarda Opatrny","is_ca":false},{"name":"Birgit Vogtenhuber","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008576215,0.0009450178,0.0008479951,0.0004348,0.001462278,0.0009446038,0.002923273,0.001991744,0.007655576],"category_scores_gemma":[0.00506429,0.0003972402,0.0008639391,0.0005609695,0.001394907,0.003260768,0.00325266,0.001937003,0.002881036],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009213915,"about_ca_system_score_gemma":0.0008191948,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002655329,"about_ca_topic_score_gemma":0.003733701,"domain_scores_codex":[0.9990953,0.0002170961,0.00005232435,0.0002364647,0.0002238912,0.0001749892],"domain_scores_gemma":[0.9974879,0.001255122,0.000219214,0.0006286869,0.0002538354,0.0001550847],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.003043693,0.0003479061,0.004597386,0.001370149,0.0001357645,0.001716965,0.002065131,0.5317238,0.03664391,0.128849,0.04281767,0.2466887],"study_design_scores_gemma":[0.0002149171,0.0004814147,0.00123848,0.0001328729,0.00004664458,0.001236626,0.001300269,0.8405063,0.05339832,0.06584866,0.03548817,0.0001072771],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1141989,0.0005427744,0.8544178,0.003494052,0.0002525101,0.0002929451,0.0003666195,0.002726493,0.02370796],"genre_scores_gemma":[0.5158733,0.0004009087,0.4692358,0.0006871913,0.00005913962,0.0002515232,0.0005816286,0.0002560671,0.01265452],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007655576,"threshold_uncertainty_score":0.02561051,"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","authors":[{"name":"R.P. Anstee","is_ca":true},{"name":"Balin Fleming","is_ca":true},{"name":"Zoltán Füredi","is_ca":false},{"name":"Attila Sali","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001108303,0.0006956852,0.0006083722,0.001923907,0.001669915,0.001875847,0.001238649,0.0009703162,0.01099778],"category_scores_gemma":[0.007254919,0.0007278371,0.0007406287,0.00147018,0.003035732,0.004627822,0.002342489,0.002406483,0.0008752404],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001745894,"about_ca_system_score_gemma":0.0005728886,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001445849,"about_ca_topic_score_gemma":0.001960305,"domain_scores_codex":[0.9987291,0.0003882398,0.00004843956,0.0002503397,0.0003789028,0.0002049034],"domain_scores_gemma":[0.9926416,0.00495153,0.0005219961,0.0008246173,0.0004792034,0.0005810601],"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.00005325369,0.00002010658,0.0003765796,0.00004807721,0.000008352129,0.0001215829,0.0002213153,0.004102645,0.001691097,0.9839512,0.001399807,0.008006021],"study_design_scores_gemma":[0.00001278219,0.00002343023,0.0002845315,0.00002141299,0.000009872426,0.0001761116,0.0001074738,0.01472761,0.001697729,0.9789768,0.003944815,0.00001730925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3833517,0.001737546,0.4761078,0.002680135,0.0003001171,0.00009265749,0.0002605184,0.0006989159,0.1347706],"genre_scores_gemma":[0.9465283,0.001038383,0.03941715,0.0006188577,0.0002678094,0.00008938877,0.0001904516,0.0002284038,0.01162132],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01099778,"threshold_uncertainty_score":0.03679121,"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","authors":[{"name":"Janusz Adamus","is_ca":false},{"name":"Lech Adamus","is_ca":false},{"name":"Anders Yeo","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009530009,0.0004402874,0.0006091377,0.001600891,0.001234764,0.001308873,0.0008114089,0.001060584,0.009307308],"category_scores_gemma":[0.005675147,0.0003758218,0.0006654251,0.0008676937,0.001949781,0.002818702,0.001576721,0.001533318,0.001029552],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001375546,"about_ca_system_score_gemma":0.0007847052,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00220167,"about_ca_topic_score_gemma":0.002738734,"domain_scores_codex":[0.999316,0.0001703431,0.00005384235,0.0001527781,0.0001381779,0.0001689102],"domain_scores_gemma":[0.9969735,0.001723663,0.0002714276,0.0002009604,0.0004493405,0.0003810714],"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.00006830153,0.00003195308,0.001051866,0.0000767934,0.00001216569,0.0001790379,0.0002998214,0.003850455,0.004052593,0.9827238,0.001639114,0.006014056],"study_design_scores_gemma":[0.00006152295,0.00007909972,0.001062186,0.00003905535,0.00001499483,0.0001455158,0.000264827,0.02767735,0.002410746,0.9627259,0.00549393,0.00002489073],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4990439,0.0009510135,0.4045242,0.003492814,0.0001848565,0.0002814067,0.001326257,0.0004567643,0.08973873],"genre_scores_gemma":[0.9563851,0.000376977,0.03338093,0.0005252052,0.0001273126,0.000266886,0.0004797652,0.00007804699,0.008379628],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009307308,"threshold_uncertainty_score":0.03113598,"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","authors":[{"name":"Valérie Berthé","is_ca":false},{"name":"Laurent Imbert","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001254315,0.0005809067,0.000817373,0.0008090625,0.0007339739,0.001643657,0.001039084,0.0005681295,0.003238691],"category_scores_gemma":[0.006956167,0.0002501894,0.0004607523,0.001150634,0.001593104,0.002400218,0.001084219,0.001345321,0.0009238859],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001960269,"about_ca_system_score_gemma":0.001295616,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001614567,"about_ca_topic_score_gemma":0.001407749,"domain_scores_codex":[0.9990834,0.0002321523,0.00004961836,0.0001560103,0.0003284336,0.0001502685],"domain_scores_gemma":[0.9976494,0.001476481,0.0002173823,0.0004291558,0.0001515415,0.00007612897],"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.0008972399,0.0001437315,0.00221909,0.0002186528,0.00004386479,0.0001174177,0.0004191747,0.2385216,0.01363132,0.6218288,0.003313618,0.1186455],"study_design_scores_gemma":[0.0001086939,0.0001118108,0.0004554406,0.0000370548,0.00002580227,0.00008881308,0.00005590617,0.6353218,0.00925714,0.3493442,0.005157084,0.00003614448],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3194454,0.001018327,0.6579857,0.0008255925,0.0001016099,0.0001040702,0.0001916443,0.001144185,0.01918347],"genre_scores_gemma":[0.6952468,0.0004047742,0.2945656,0.0001265318,0.00007491001,0.0001648392,0.0002799291,0.0002585789,0.008878076],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003238691,"threshold_uncertainty_score":0.01422274,"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","authors":[{"name":"Marc Distel","is_ca":false},{"name":"Robert Hickingbotham","is_ca":false},{"name":"Tony Huynh","is_ca":false},{"name":"David R. Wood","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000664905,0.0007207223,0.0007980216,0.001754025,0.001241806,0.002624692,0.001200208,0.0009466467,0.01290063],"category_scores_gemma":[0.002446359,0.0005374262,0.001034784,0.001730814,0.001588667,0.005080372,0.002754206,0.001959317,0.002348412],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001403704,"about_ca_system_score_gemma":0.0004952233,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00236106,"about_ca_topic_score_gemma":0.002235963,"domain_scores_codex":[0.9992892,0.0001350607,0.00003632054,0.0002088879,0.0002234122,0.0001071779],"domain_scores_gemma":[0.9988803,0.0002897426,0.0000848732,0.0003036401,0.0003053313,0.0001360207],"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.00005471481,0.00002258485,0.0002678095,0.00005828901,0.00000836546,0.00007457817,0.0002712223,0.00307832,0.001407646,0.9716018,0.004041541,0.01911307],"study_design_scores_gemma":[0.00001897082,0.00005734065,0.0003786803,0.0000257729,0.00001885093,0.0001237599,0.0001144168,0.02209831,0.001157347,0.9450398,0.03094635,0.00002036528],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3195129,0.003074948,0.4865396,0.002944818,0.000880138,0.0001807264,0.001538504,0.001821926,0.1835063],"genre_scores_gemma":[0.799981,0.001711508,0.1427922,0.0006238792,0.0006007723,0.0001527953,0.002424289,0.0006803528,0.05103317],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01290063,"threshold_uncertainty_score":0.04315686,"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","authors":[{"name":"Louigi Addario‐Berry","is_ca":true},{"name":"Nicolas Broutin","is_ca":true},{"name":"Bruce Reed","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001364742,0.0004071456,0.0007973018,0.0008747631,0.0008494132,0.001825777,0.001207137,0.0008977725,0.001531906],"category_scores_gemma":[0.0107076,0.0007650083,0.0003667932,0.0007149146,0.001282114,0.002763133,0.001180299,0.0008305669,0.0003456337],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001082635,"about_ca_system_score_gemma":0.0004343106,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008896688,"about_ca_topic_score_gemma":0.0007903757,"domain_scores_codex":[0.9992588,0.000227365,0.00004210622,0.0002134936,0.0001326019,0.0001256444],"domain_scores_gemma":[0.9907773,0.006154422,0.001004416,0.0005415325,0.00053551,0.0009869073],"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.003034958,0.0002329712,0.0521911,0.0009924605,0.0005238969,0.001221183,0.002216189,0.2335872,0.08451726,0.4965342,0.02902544,0.0959231],"study_design_scores_gemma":[0.0001806245,0.0003129173,0.02193271,0.00009912135,0.0001440717,0.002030994,0.000551069,0.4856968,0.01491067,0.4646176,0.009447921,0.00007542869],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9031426,0.001140243,0.08420587,0.002112976,0.00007686413,0.00003035885,0.001478902,0.0001743326,0.007637799],"genre_scores_gemma":[0.9730978,0.001023569,0.02172194,0.0001820154,0.0001797083,0.0001236419,0.001237852,0.0001067645,0.002326749],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.001825777,"threshold_uncertainty_score":0.007855058,"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","authors":[{"name":"Christian Stump","is_ca":false},{"name":"Hugh Thomas","is_ca":false},{"name":"Nathan Williams","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009718331,0.0004348715,0.0004113519,0.0007751118,0.002952575,0.004087476,0.0006391783,0.001610783,0.009586996],"category_scores_gemma":[0.002881117,0.0001682496,0.0004829768,0.0008098913,0.007173825,0.005622435,0.002009977,0.002510717,0.001641415],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003405688,"about_ca_system_score_gemma":0.0008262773,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01077501,"about_ca_topic_score_gemma":0.008115469,"domain_scores_codex":[0.9991979,0.0001863652,0.00002211301,0.0002592031,0.0002045048,0.0001298371],"domain_scores_gemma":[0.9991566,0.0002710358,0.00006021666,0.0001957061,0.0002002007,0.0001161562],"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.00001586563,0.000001894244,0.0001811557,0.00001148491,0.000001496045,0.00003604686,0.0002714663,0.00007938432,0.00007722222,0.9885685,0.004730176,0.006025221],"study_design_scores_gemma":[0.000008714735,0.00001233277,0.0005488934,0.0000550785,0.000004384385,0.0002446406,0.0005615918,0.0008130482,0.0002947703,0.8893712,0.1080719,0.00001357373],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1118361,0.0100776,0.04244075,0.0615823,0.003429371,0.00002866864,0.0004986249,0.000640781,0.7694658],"genre_scores_gemma":[0.9040805,0.002682079,0.008332219,0.009037657,0.001002108,0.00003214339,0.0002192163,0.0002545545,0.07435964],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01077501,"threshold_uncertainty_score":0.03207165,"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","authors":[{"name":"Henryk Fukś","is_ca":false},{"name":"Andrew Skelton","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007280209,0.0003162562,0.000636456,0.0008539618,0.0008805002,0.001354717,0.0009867427,0.0007492726,0.001568827],"category_scores_gemma":[0.003940001,0.0002904648,0.000659093,0.0004033696,0.002113902,0.001400836,0.0008405853,0.0007981467,0.0001984788],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001236547,"about_ca_system_score_gemma":0.0006476031,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003682777,"about_ca_topic_score_gemma":0.002046572,"domain_scores_codex":[0.9996131,0.000102912,0.0000235005,0.00005523468,0.00012128,0.00008396746],"domain_scores_gemma":[0.9980685,0.001082927,0.0002964172,0.000152057,0.0001684749,0.0002316309],"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.0001269678,0.00005154777,0.002120671,0.00005129145,0.00002428349,0.0002692337,0.0003975318,0.3517807,0.006998633,0.6327818,0.0003195789,0.005077784],"study_design_scores_gemma":[0.00001231062,0.0000240258,0.0003350162,0.000008973342,0.000005619457,0.00003810549,0.00003208559,0.8820239,0.001231962,0.1160173,0.0002537658,0.00001704658],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8117672,0.0002949108,0.1801335,0.0001570379,0.00004533503,0.00003910637,0.00006086212,0.0001706846,0.007331484],"genre_scores_gemma":[0.9846646,0.0001144606,0.01351409,0.00001920152,0.00002220378,0.00004142175,0.0000387628,0.00003224804,0.001553029],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003682777,"threshold_uncertainty_score":0.00897181,"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","authors":[{"name":"Sophie Burrill","is_ca":true},{"name":"Marni Mishna","is_ca":true},{"name":"Jacob Post","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001461443,0.0006442051,0.0007400048,0.002177446,0.001431431,0.002138595,0.0008541002,0.0007783463,0.005156169],"category_scores_gemma":[0.006491983,0.0005301996,0.00100122,0.002379439,0.002966021,0.003733353,0.001863639,0.001654033,0.0009445281],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001564736,"about_ca_system_score_gemma":0.0007581262,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001552269,"about_ca_topic_score_gemma":0.00150911,"domain_scores_codex":[0.9984105,0.0002916276,0.0001155252,0.0004582821,0.0003290699,0.0003949155],"domain_scores_gemma":[0.9942439,0.00287227,0.001062567,0.0007151404,0.0004586529,0.0006474528],"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.0001732487,0.00008586401,0.01066769,0.0001403048,0.00003519224,0.0004758636,0.001138949,0.01628039,0.01307893,0.9052803,0.002212947,0.05043031],"study_design_scores_gemma":[0.00002496184,0.00008931047,0.008732385,0.00008195308,0.00003416489,0.001559337,0.0003650552,0.06470247,0.005750379,0.9054268,0.0131544,0.0000788757],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5515025,0.001544763,0.4002195,0.0006260583,0.0001179862,0.00006881425,0.0007211431,0.0003805339,0.04481854],"genre_scores_gemma":[0.9141949,0.001489443,0.06853291,0.0003254993,0.0002063473,0.0001434037,0.0007178253,0.0002104404,0.0141792],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005156169,"threshold_uncertainty_score":0.01724905,"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","authors":[{"name":"Srečko Brlek","is_ca":false},{"name":"Guy Mélançon","is_ca":false},{"name":"Geneviève Paquin","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002463731,0.0003207949,0.0004497099,0.001426943,0.0011557,0.002155611,0.000390119,0.0005921592,0.004691307],"category_scores_gemma":[0.001848626,0.0004632569,0.0003981745,0.0006544655,0.001807937,0.001637813,0.0009348757,0.0007007773,0.0004786726],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005001375,"about_ca_system_score_gemma":0.0002994356,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003334472,"about_ca_topic_score_gemma":0.0003800742,"domain_scores_codex":[0.9997479,0.00003527725,0.00002528853,0.00006265481,0.00006634482,0.00006248904],"domain_scores_gemma":[0.9992028,0.0003467021,0.0001643524,0.0000661313,0.0001089517,0.0001110343],"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.0002372833,0.00004687551,0.003551948,0.0001802177,0.00002708671,0.0009976743,0.0009611886,0.00329817,0.02842452,0.9459143,0.0006599862,0.01570069],"study_design_scores_gemma":[0.00004794068,0.0001590753,0.004900356,0.00007662873,0.00006185571,0.001283636,0.0007406874,0.0183286,0.01673621,0.9510281,0.006553228,0.00008371065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9622951,0.000284594,0.02266076,0.0001197929,0.00002923372,0.0000217857,0.0001516931,0.0001481244,0.014289],"genre_scores_gemma":[0.9913449,0.0001099434,0.004261075,0.00002410337,0.00003880763,0.00002915368,0.0001813619,0.00003940372,0.003971364],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004691307,"threshold_uncertainty_score":0.01569396,"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","authors":[{"name":"Sho Matsumoto","is_ca":false},{"name":"Jonathan Novak","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007112642,0.0004745283,0.0005759277,0.001649125,0.001304406,0.001493061,0.000627936,0.0007101849,0.005306612],"category_scores_gemma":[0.003452024,0.0002730836,0.0006776426,0.001470537,0.00279696,0.004343837,0.001168311,0.001495061,0.0008238923],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001058061,"about_ca_system_score_gemma":0.0006705342,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001039725,"about_ca_topic_score_gemma":0.001583873,"domain_scores_codex":[0.9994127,0.0001044248,0.00003732242,0.0001015453,0.0002030514,0.000141069],"domain_scores_gemma":[0.9988497,0.0005979798,0.000151964,0.0001638158,0.0001532473,0.00008329003],"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.0000282452,0.00001169532,0.0003506365,0.00004685142,0.000002466179,0.00006025333,0.0001739309,0.00175322,0.001046733,0.9813257,0.0006755653,0.01452466],"study_design_scores_gemma":[0.000003952719,0.00002482916,0.0001354743,0.00001730535,0.000003826506,0.0001002478,0.00009861652,0.007718216,0.001363248,0.9869294,0.00359497,0.000009884443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3713729,0.00163676,0.5448459,0.00100848,0.0001903219,0.0001429835,0.0004374923,0.0005529382,0.07981212],"genre_scores_gemma":[0.7930892,0.001056439,0.1861051,0.0002018668,0.0002285226,0.0001459479,0.0004899814,0.0001066329,0.01857642],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005306612,"threshold_uncertainty_score":0.01775235,"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","authors":[{"name":"Chris Deugau","is_ca":false},{"name":"Frank Ruskey","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004113806,0.0004367047,0.0004968733,0.001331917,0.0008134309,0.001180586,0.0007365766,0.000688179,0.002065426],"category_scores_gemma":[0.002563173,0.0002740308,0.0006170286,0.001161231,0.000995817,0.002034998,0.0006463644,0.0007288158,0.0003486739],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000666547,"about_ca_system_score_gemma":0.0003347359,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005117059,"about_ca_topic_score_gemma":0.0008581856,"domain_scores_codex":[0.9996521,0.00005463335,0.00002749292,0.00007660943,0.0001214104,0.00006769804],"domain_scores_gemma":[0.9988449,0.0004655612,0.0002553048,0.0001538309,0.0001812559,0.00009916767],"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.00004156576,0.00001227078,0.001148682,0.00008021039,0.00001121579,0.0004487595,0.0003513065,0.00682334,0.00801318,0.9697262,0.00048311,0.01286016],"study_design_scores_gemma":[0.00001615708,0.00004293631,0.001579879,0.00004241917,0.00002137468,0.001219191,0.0001564888,0.04825767,0.004636965,0.9383271,0.005664961,0.00003480824],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6495317,0.001239265,0.3219839,0.0002754177,0.0000841587,0.00007383026,0.0003795854,0.0002864359,0.02614561],"genre_scores_gemma":[0.9306597,0.0005459059,0.06206606,0.000117088,0.00009759062,0.0001529673,0.0002992995,0.00006134751,0.006000014],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002065426,"threshold_uncertainty_score":0.00690949,"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","authors":[{"name":"Alexandre Blondin Massé","is_ca":false},{"name":"Srečko Brlek","is_ca":false},{"name":"Amy Glen","is_ca":false},{"name":"Sebastien Labbé","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005793861,0.000488957,0.0006441228,0.001991216,0.0007614455,0.002021128,0.0004598351,0.0004378381,0.002155666],"category_scores_gemma":[0.004149462,0.0002167903,0.0004786439,0.0008145862,0.002314898,0.002777151,0.001092699,0.0007509699,0.0002695892],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007652733,"about_ca_system_score_gemma":0.0003028232,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009347128,"about_ca_topic_score_gemma":0.0008968082,"domain_scores_codex":[0.9997546,0.00004124746,0.00002181915,0.00005657168,0.00005619089,0.00006966882],"domain_scores_gemma":[0.9983982,0.0009344307,0.000190735,0.0001177826,0.0002026102,0.0001562153],"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.0004263373,0.00005220219,0.009580777,0.000180608,0.00003088928,0.001348384,0.002001601,0.01641551,0.01722249,0.930833,0.0008263704,0.02108184],"study_design_scores_gemma":[0.00004342748,0.00006628162,0.001942766,0.00006982518,0.00002948199,0.000509486,0.0004971508,0.08005125,0.007910257,0.905629,0.003208376,0.00004266097],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9482401,0.0006542462,0.04379541,0.0001941975,0.00003633206,0.00003157842,0.00008184527,0.00012516,0.00684125],"genre_scores_gemma":[0.986684,0.0002422675,0.01175218,0.00003371872,0.00005036259,0.00002495872,0.00007059196,0.00003740418,0.001104512],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002155666,"threshold_uncertainty_score":0.007211387,"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","authors":[{"name":"Jean-Alexandre Anglès d'Auriac","is_ca":false},{"name":"Nathann Cohen","is_ca":false},{"name":"Hakim El Mafthoui","is_ca":false},{"name":"Ararat Harutyunyan","is_ca":false},{"name":"Sylvain Legay","is_ca":false},{"name":"Yannis Manoussakis","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006684338,0.0004161617,0.0005793207,0.0009315459,0.000846654,0.001408228,0.000937906,0.0006043262,0.003336707],"category_scores_gemma":[0.005500054,0.0005475591,0.0006561148,0.001237236,0.001341619,0.003170835,0.001258218,0.001039781,0.0002764239],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001254352,"about_ca_system_score_gemma":0.000801852,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002421301,"about_ca_topic_score_gemma":0.003233734,"domain_scores_codex":[0.999236,0.0001884728,0.00003987598,0.0002044597,0.0001675804,0.0001636072],"domain_scores_gemma":[0.9932904,0.004576965,0.0007627665,0.0005821396,0.0003080365,0.0004796966],"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.001185791,0.0002795669,0.01183012,0.001039315,0.0001620438,0.001334548,0.001477338,0.2776104,0.06199861,0.5634009,0.008490167,0.0711912],"study_design_scores_gemma":[0.000115309,0.0001291495,0.004255955,0.00006878733,0.0001004424,0.001043044,0.0004252105,0.341199,0.0193088,0.6277977,0.005514297,0.0000422245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7064362,0.0006165827,0.2772701,0.001065756,0.00004194113,0.0002087202,0.00128037,0.0008498257,0.01223045],"genre_scores_gemma":[0.9338432,0.0004235077,0.06210532,0.0001647282,0.00006357128,0.0000929508,0.001081236,0.0001368578,0.00208861],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003336707,"threshold_uncertainty_score":0.01116234,"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","authors":[{"name":"Jarkko Kari","is_ca":false},{"name":"Siamak Taati","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005246226,0.0003058926,0.00039335,0.0008953835,0.0008246012,0.002016241,0.0006701972,0.0004859234,0.002338729],"category_scores_gemma":[0.003080857,0.0002044352,0.0006198638,0.000393545,0.002861717,0.001959543,0.001251834,0.00077797,0.0002450917],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006939394,"about_ca_system_score_gemma":0.0003960432,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009091452,"about_ca_topic_score_gemma":0.0005361563,"domain_scores_codex":[0.9993265,0.000116333,0.00004905026,0.0001601035,0.0002371125,0.000110963],"domain_scores_gemma":[0.9977913,0.000907769,0.0003580152,0.000446852,0.0002789818,0.0002170788],"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.000009707143,0.00001893729,0.0005279163,0.00002498352,0.000008821983,0.0001231136,0.0002543764,0.006089096,0.002634579,0.985838,0.0001359286,0.004334494],"study_design_scores_gemma":[0.000009868158,0.00004864036,0.0007299879,0.00001275525,0.00001557376,0.0001889335,0.0001605049,0.06798418,0.003431546,0.9254613,0.001935325,0.00002129496],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6397184,0.0006143952,0.3255294,0.0004080534,0.000105728,0.00005010052,0.0001190396,0.000303522,0.03315138],"genre_scores_gemma":[0.9885105,0.0001838451,0.008898811,0.00004543356,0.00004253079,0.0000345637,0.00003301368,0.00002185859,0.002229486],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002338729,"threshold_uncertainty_score":0.007823884,"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","authors":[{"name":"Aaron D. Lauda","is_ca":true},{"name":"Monica Vazirani","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003694089,0.0002936112,0.0003803195,0.001764911,0.001466692,0.001992489,0.0004555419,0.0004936696,0.004657899],"category_scores_gemma":[0.001036485,0.0002256783,0.000401969,0.0009581873,0.001945423,0.002433372,0.001785774,0.0006658873,0.000352795],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001104715,"about_ca_system_score_gemma":0.0005155489,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00156507,"about_ca_topic_score_gemma":0.001623333,"domain_scores_codex":[0.9996002,0.00006048985,0.00002301377,0.00006825163,0.0001625297,0.00008555652],"domain_scores_gemma":[0.9994312,0.0001406028,0.0001343329,0.00005072478,0.0001106418,0.0001324349],"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.00001427325,0.00001148433,0.001218691,0.00003627122,0.000005793801,0.0000919767,0.0006107469,0.0008797834,0.002372965,0.9916859,0.0002940042,0.00277807],"study_design_scores_gemma":[0.00001658761,0.00004710429,0.002413714,0.00002793769,0.00001093369,0.0003517358,0.000805904,0.01031635,0.003793772,0.9736717,0.008518478,0.0000257831],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9280009,0.0005270931,0.04296133,0.0003329435,0.00005369458,0.00005034023,0.0001795488,0.00008168821,0.02781256],"genre_scores_gemma":[0.9811902,0.000243089,0.009038301,0.00005742377,0.00005981243,0.00004474454,0.0002143821,0.0000258238,0.009126215],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004657899,"threshold_uncertainty_score":0.0155822,"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","authors":[{"name":"Alexander Burstein","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00216272,0.0003154432,0.0007920223,0.001891376,0.0009412146,0.002029092,0.001223208,0.0007936093,0.005443335],"category_scores_gemma":[0.01492579,0.0003566239,0.0006221881,0.002227155,0.003630577,0.00329926,0.001251084,0.001410134,0.0004463558],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001210789,"about_ca_system_score_gemma":0.000592784,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001139584,"about_ca_topic_score_gemma":0.001280086,"domain_scores_codex":[0.9987847,0.0002834018,0.0000773152,0.0003247919,0.0002994758,0.0002304328],"domain_scores_gemma":[0.979331,0.01522419,0.002087041,0.001731552,0.0009413934,0.0006848714],"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.0002220103,0.00004954947,0.01979199,0.00008594446,0.00003628091,0.0002741025,0.000886392,0.01817692,0.004893101,0.9400706,0.001172806,0.01434032],"study_design_scores_gemma":[0.00004701532,0.0001323915,0.01216834,0.00005772305,0.0000302559,0.0005739356,0.000396304,0.1161432,0.004121288,0.8634259,0.002825706,0.00007801449],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8307654,0.0002948522,0.1576853,0.0006895054,0.00003699628,0.00002949837,0.0007234212,0.0001588035,0.009616124],"genre_scores_gemma":[0.9864249,0.0002161413,0.009717088,0.0001065134,0.00005710393,0.00007085138,0.0005092405,0.00003496777,0.002863148],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005443335,"threshold_uncertainty_score":0.01820976,"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","authors":[{"name":"Ben Seamone","is_ca":true},{"name":"Brett Stevens","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002553516,0.0007684335,0.001152976,0.00167475,0.00159486,0.002338435,0.002537903,0.0020154,0.01160611],"category_scores_gemma":[0.02565652,0.0007134376,0.001251965,0.001997879,0.003090992,0.008261106,0.00359373,0.004532645,0.00148491],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001633357,"about_ca_system_score_gemma":0.0006687298,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009895514,"about_ca_topic_score_gemma":0.0008709125,"domain_scores_codex":[0.9973598,0.0006689672,0.0001454253,0.0006260671,0.0006990207,0.0005007447],"domain_scores_gemma":[0.9664178,0.02080113,0.003061433,0.005646695,0.002118256,0.001954641],"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.0009589961,0.0001988922,0.007774238,0.0003380189,0.00007803646,0.0006364029,0.0007034932,0.04044581,0.01184438,0.8921076,0.009899409,0.03501481],"study_design_scores_gemma":[0.00008763099,0.0001888133,0.002074138,0.00004355783,0.00004671959,0.0005870709,0.0001640926,0.08165761,0.003967448,0.9034721,0.007639136,0.00007168075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6022239,0.001110387,0.3179644,0.007696913,0.0004667579,0.00020023,0.001190114,0.001276815,0.06787051],"genre_scores_gemma":[0.9418034,0.0005011694,0.04535357,0.001208403,0.0004079723,0.0001849766,0.00064383,0.0003337308,0.009562983],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01160611,"threshold_uncertainty_score":0.03882629,"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","authors":[{"name":"Konstantinos Georgiou","is_ca":true},{"name":"George Karakostas","is_ca":true},{"name":"Evangelos Kranakis","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00222468,0.00157806,0.002192287,0.001079514,0.001644271,0.002476652,0.005847133,0.004408366,0.009783964],"category_scores_gemma":[0.01279184,0.000826236,0.001410167,0.001612241,0.002568703,0.007957116,0.003920288,0.002937214,0.001633654],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001740782,"about_ca_system_score_gemma":0.0009716765,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003403295,"about_ca_topic_score_gemma":0.00249732,"domain_scores_codex":[0.9978308,0.0007585801,0.00008345094,0.0004631671,0.00039945,0.0004644822],"domain_scores_gemma":[0.9884977,0.008103013,0.001339771,0.0009868958,0.0005375675,0.0005349771],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004556967,0.0001897892,0.0006051394,0.0002488601,0.0000461058,0.0004354385,0.0003595675,0.8178465,0.001513813,0.1581937,0.003557699,0.01654756],"study_design_scores_gemma":[0.00003747143,0.00007234207,0.00007151604,0.00001104463,0.00001094108,0.0000820555,0.00009581428,0.9627944,0.0003931027,0.03550592,0.0009078971,0.00001749824],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1033637,0.001235348,0.8718308,0.002910136,0.0001996386,0.0002219029,0.0004200857,0.0003203866,0.01949797],"genre_scores_gemma":[0.85245,0.00140688,0.1140567,0.0004882772,0.0003043209,0.0006126343,0.0003087779,0.000176501,0.03019581],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009783964,"threshold_uncertainty_score":0.03273058,"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","authors":[{"name":"Felipe García‐Ramos","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002940662,0.0003406487,0.0003445834,0.0006146002,0.0006081069,0.00126807,0.0004412697,0.0003120489,0.006135995],"category_scores_gemma":[0.0007425811,0.0001975733,0.0004210942,0.0003206646,0.000892872,0.00168808,0.001026252,0.0006076802,0.001037679],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000478854,"about_ca_system_score_gemma":0.0004040445,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007477009,"about_ca_topic_score_gemma":0.0007237552,"domain_scores_codex":[0.9995036,0.00006893952,0.000037573,0.0001383401,0.0001475097,0.000104084],"domain_scores_gemma":[0.9993153,0.0001372635,0.00008289844,0.0001343795,0.0002212515,0.0001089137],"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.00007820153,0.00003118118,0.0005816973,0.00007784764,0.00001136022,0.0002123525,0.0004441343,0.007675502,0.01482226,0.954055,0.0005696625,0.02144082],"study_design_scores_gemma":[0.00002689391,0.000224553,0.00135907,0.00004628846,0.0000416154,0.0007079548,0.0003449217,0.113397,0.03078492,0.8200771,0.03291583,0.00007381372],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4845639,0.0005728895,0.4606996,0.000114704,0.0001232198,0.0001042307,0.0003015756,0.0005706996,0.0529491],"genre_scores_gemma":[0.9118843,0.0003060724,0.06995147,0.00007644558,0.000056705,0.0001557621,0.0003794609,0.0001432309,0.01704661],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006135995,"threshold_uncertainty_score":0.02052695,"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","authors":[{"name":"Prosenjit Bose","is_ca":true},{"name":"Jean Cardinal","is_ca":false},{"name":"Sébastien Collette","is_ca":false},{"name":"Ferrán Hurtado","is_ca":false},{"name":"Matias Korman","is_ca":false},{"name":"Stefan Langerman","is_ca":false},{"name":"Perouz Taslakian","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008412933,0.0006446845,0.0008979694,0.001079215,0.001559448,0.002828064,0.001453043,0.001085902,0.01287208],"category_scores_gemma":[0.004877967,0.000594733,0.0009284525,0.002098012,0.002917696,0.005455799,0.002183312,0.002076129,0.001286187],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002221093,"about_ca_system_score_gemma":0.0009131095,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003103089,"about_ca_topic_score_gemma":0.003246933,"domain_scores_codex":[0.9982885,0.0004326692,0.000123746,0.000453414,0.0003356091,0.0003660886],"domain_scores_gemma":[0.9953873,0.002193045,0.0005949992,0.001048419,0.0002821607,0.0004941258],"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.0003187193,0.0001045237,0.002161067,0.000236708,0.00003110419,0.000223754,0.000357942,0.07317972,0.006944187,0.8438243,0.008776483,0.06384147],"study_design_scores_gemma":[0.00008564058,0.0001122395,0.00118977,0.00005207319,0.00003343974,0.0004409394,0.0003745742,0.1103073,0.00534996,0.8499651,0.03205334,0.00003559356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3039538,0.001593387,0.6059539,0.002891893,0.0003129858,0.0002184182,0.001547281,0.001549684,0.08197869],"genre_scores_gemma":[0.7147684,0.001398464,0.2564314,0.0006168887,0.0002807832,0.0002809182,0.002065766,0.0005029293,0.02365449],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01287208,"threshold_uncertainty_score":0.04306138,"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","authors":[{"name":"Silvio Capobianco","is_ca":false},{"name":"P. Guillon","is_ca":true},{"name":"Jarkko Kari","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004159313,0.0002563222,0.0003568684,0.000554566,0.0008058947,0.002253284,0.0003192164,0.0004892838,0.002318653],"category_scores_gemma":[0.002193673,0.0001396708,0.0002733592,0.0004306402,0.00205448,0.002702758,0.001586918,0.0005697555,0.0002516228],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006649171,"about_ca_system_score_gemma":0.0003492005,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009679889,"about_ca_topic_score_gemma":0.0008743848,"domain_scores_codex":[0.9996517,0.0000596374,0.00002930417,0.0001106527,0.00007703866,0.00007172134],"domain_scores_gemma":[0.9987581,0.0004872585,0.00015394,0.0002659978,0.0001586368,0.0001760863],"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.00004197866,0.00000833452,0.0009217739,0.00002053913,0.000006011363,0.00008714588,0.0003602357,0.003710185,0.00288423,0.9873568,0.0001709967,0.004431776],"study_design_scores_gemma":[0.00001719846,0.00003634405,0.0007934679,0.0000184582,0.00001519308,0.0001776387,0.0005242479,0.02200968,0.00470124,0.9652289,0.006462791,0.00001478262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8412229,0.0008599674,0.1131125,0.0005472082,0.0000536033,0.00002632258,0.0001528767,0.000224663,0.0438],"genre_scores_gemma":[0.9914092,0.0002014382,0.005972624,0.0000390768,0.00001218902,0.00001800596,0.00004284558,0.000007920044,0.002296739],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002318653,"threshold_uncertainty_score":0.00775665,"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","authors":[{"name":"Ben Seamone","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001138032,0.0006860544,0.000852656,0.001660774,0.000785831,0.001717493,0.001395242,0.0007068477,0.003863059],"category_scores_gemma":[0.006453322,0.0005736065,0.0008441873,0.001300861,0.002430146,0.002765562,0.00144512,0.001849044,0.0004395531],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001933586,"about_ca_system_score_gemma":0.000566242,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00112836,"about_ca_topic_score_gemma":0.001432898,"domain_scores_codex":[0.9992303,0.0001259695,0.00003902033,0.0001974331,0.0002010362,0.0002062088],"domain_scores_gemma":[0.9964187,0.002226352,0.0003853666,0.0004005019,0.000187079,0.0003819633],"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.0002694776,0.0001104082,0.005600997,0.0001901156,0.00004288648,0.0002800262,0.0004666449,0.09593665,0.02059061,0.8547293,0.00147963,0.02030325],"study_design_scores_gemma":[0.00003739447,0.0001333106,0.00271142,0.00004326259,0.00004584176,0.0002714294,0.0001170118,0.2540983,0.009491962,0.7303018,0.002697004,0.00005123165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6733948,0.000530766,0.295638,0.0007679009,0.00006136347,0.00007042788,0.0005719156,0.0002953553,0.0286695],"genre_scores_gemma":[0.969062,0.000462899,0.02612478,0.00007399407,0.00009053986,0.00005164624,0.0003257108,0.00009480157,0.003713589],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003863059,"threshold_uncertainty_score":0.01402926,"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","authors":[{"name":"Jan Foniok","is_ca":false},{"name":"Claude Tardif","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001948893,0.0004186218,0.000541765,0.001780377,0.001630534,0.003360829,0.0007202845,0.001150063,0.004344951],"category_scores_gemma":[0.00439271,0.0004437256,0.001089929,0.001223679,0.004889879,0.007975814,0.004172899,0.002644229,0.0004429904],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002007655,"about_ca_system_score_gemma":0.001362502,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001341757,"about_ca_topic_score_gemma":0.001106552,"domain_scores_codex":[0.9980053,0.000585955,0.0001323114,0.0004556561,0.0004806647,0.0003401225],"domain_scores_gemma":[0.9966363,0.00165212,0.0002731509,0.0005992433,0.000457871,0.0003813473],"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.00001273211,0.00001378688,0.0002330744,0.00001929407,0.000004039859,0.00004045347,0.0002122274,0.001004621,0.0003425496,0.9922088,0.0003546336,0.005553687],"study_design_scores_gemma":[0.000006234656,0.00001361948,0.0001791479,0.0000118341,0.000005705625,0.00009086614,0.00008387066,0.004194863,0.0004421957,0.9879526,0.007010638,0.000008268948],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1921842,0.00213074,0.7243893,0.00422568,0.0002839167,0.00008360496,0.0004083806,0.001026909,0.07526717],"genre_scores_gemma":[0.9144784,0.0006943363,0.07092456,0.0006366801,0.0001803288,0.0001058064,0.0003520102,0.0002017575,0.01242607],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004344951,"threshold_uncertainty_score":0.0145666,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}