{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":25,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":25,"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":"1d3d63e81b96","filters":{"venue":"Ars Mathematica Contemporanea"}},"results":[{"id":"W1930124199","doi":"10.26493/1855-3974.196.0df","title":"Gray code numbers for graphs","year":2011,"lang":"en","type":"article","venue":"Ars Mathematica Contemporanea","topic":"Graph Labeling and Dimension Problems","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":"University of Victoria","funders":"","keywords":"Combinatorics; Mathematics; Gray code; Vertex (graph theory); Graph; Discrete mathematics; Algorithm","authors":[{"name":"Kelly Choo","is_ca":true},{"name":"Gary MacGillivray","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06167349681544703,"gpt":0.2536088075405026,"spread":0.1919353107250556,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000431715,0.0005896493,0.0004628991,0.002762437,0.001020209,0.002139468,0.0006068876,0.0009241535,0.00825364],"category_scores_gemma":[0.003578826,0.0002470573,0.0004057886,0.002142679,0.002212303,0.002364948,0.001364705,0.001972349,0.001403158],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001951856,"about_ca_system_score_gemma":0.0005532212,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001673414,"about_ca_topic_score_gemma":0.001548112,"domain_scores_codex":[0.9995568,0.00009867175,0.00001918856,0.00009516239,0.0001336255,0.00009659887],"domain_scores_gemma":[0.9985393,0.0008048505,0.0001398631,0.0001637239,0.0001822681,0.0001700342],"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.00001718918,0.000006894501,0.0001817299,0.00003108344,0.000002662121,0.00003612284,0.00009954044,0.001678088,0.000687806,0.9845718,0.002915293,0.009771789],"study_design_scores_gemma":[0.000007356769,0.000008195549,0.0002123592,0.00002287294,0.000003306895,0.0000674652,0.00004422447,0.006198334,0.0004923758,0.9807214,0.01221192,0.00001024528],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2761443,0.007361852,0.3613296,0.004867264,0.00120965,0.0001543449,0.001651092,0.001107461,0.3461745],"genre_scores_gemma":[0.8459671,0.003087799,0.1124905,0.001070597,0.0006155347,0.0002795907,0.0008701773,0.0002919244,0.0353268],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00825364,"threshold_uncertainty_score":0.02761114,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1935837271","doi":"10.26493/1855-3974.280.8d3","title":"Cayley graphs on nilpotent groups with cyclic commutator subgroup are hamiltonian","year":2013,"lang":"en","type":"article","venue":"Ars Mathematica Contemporanea","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":19,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Lethbridge","funders":"","keywords":"Mathematics; Nilpotent; Commutator subgroup; Cayley graph; Combinatorics; Commutator; Cayley's theorem; Hamiltonian (control theory); Characteristic subgroup; Nilpotent group; Pure mathematics; Discrete mathematics; Algebra over a field; Normal subgroup; Group (periodic table); Graph","authors":[{"name":"Ebrahim Ghaderpour","is_ca":true},{"name":"Dave Witte Morris","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05551745062615196,"gpt":0.2872404894410327,"spread":0.2317230388148807,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001373089,0.0002860872,0.0002548273,0.0007418134,0.0009150983,0.001003371,0.0004307492,0.0003846615,0.006089005],"category_scores_gemma":[0.0008137865,0.0002080822,0.0002755971,0.0006397539,0.001019811,0.001172221,0.0006833271,0.0004566919,0.0004308624],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004674666,"about_ca_system_score_gemma":0.0003186602,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001293015,"about_ca_topic_score_gemma":0.002374327,"domain_scores_codex":[0.9998454,0.00003373462,0.000006658668,0.00003801711,0.00003307009,0.00004311647],"domain_scores_gemma":[0.99932,0.0002547325,0.0001568498,0.00007662686,0.00007834153,0.0001133452],"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.00006608038,0.00003842418,0.002176238,0.0001039291,0.00003185984,0.0006868701,0.0007936171,0.003149332,0.008659565,0.9676151,0.002114118,0.01456475],"study_design_scores_gemma":[0.00003670882,0.00004559903,0.001403605,0.0000207156,0.00003345766,0.0004364961,0.0005293206,0.01454512,0.004996787,0.970338,0.007596089,0.0000180057],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8960927,0.0003728993,0.04555017,0.0004330768,0.0001109745,0.00005592378,0.0002316407,0.000231174,0.05692139],"genre_scores_gemma":[0.9880137,0.000221769,0.005515803,0.0001335937,0.00004181175,0.00003269671,0.0001695588,0.00003058511,0.005840546],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006089005,"threshold_uncertainty_score":0.02036977,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1864023698","doi":"10.26493/1855-3974.771.9b3","title":"On colour-preserving automorphisms of Cayley graphs","year":2015,"lang":"en","type":"article","venue":"Ars Mathematica Contemporanea","topic":"Finite Group Theory Research","field":"Mathematics","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 Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada; Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Automorphism; Mathematics; Cayley graph; Combinatorics; Vertex-transitive graph; Automorphism group; Automorphisms of the symmetric and alternating groups; Graph; Property (philosophy); Simple (philosophy); Discrete mathematics; Voltage graph; Line graph","authors":[{"name":"Ademir Hujdurović","is_ca":false},{"name":"Klavdija Kutnar","is_ca":false},{"name":"Dave Witte Morris","is_ca":true},{"name":"Joy Morris","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1895762039963469,"gpt":0.3597724912904059,"spread":0.170196287294059,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005429718,0.0004869883,0.0003494557,0.001437893,0.001023619,0.001346308,0.0005222713,0.0006353642,0.00267144],"category_scores_gemma":[0.002952263,0.000283901,0.0007970215,0.0009021307,0.002369426,0.001726203,0.0009092963,0.0009664268,0.0004358002],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001016867,"about_ca_system_score_gemma":0.0004890609,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002297835,"about_ca_topic_score_gemma":0.002668707,"domain_scores_codex":[0.9995179,0.0001295704,0.00002413402,0.0000993902,0.000108924,0.0001200197],"domain_scores_gemma":[0.9977491,0.0009925204,0.0004617391,0.0003109522,0.000200583,0.0002850904],"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.00009592532,0.00007363046,0.001922673,0.00007945377,0.00002161965,0.0003246523,0.001088045,0.01016397,0.01297395,0.9582348,0.001140932,0.01388031],"study_design_scores_gemma":[0.00003264597,0.00007467806,0.001170189,0.00002475695,0.00001921883,0.0001826826,0.0002630498,0.01922317,0.003677794,0.9688534,0.006457855,0.00002043482],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8740061,0.0008945682,0.08403102,0.0004375129,0.0001898324,0.00005537889,0.0001637226,0.000211261,0.04001069],"genre_scores_gemma":[0.9710345,0.0007442393,0.01514776,0.000145194,0.0002121241,0.00004526219,0.0002922318,0.0001042092,0.0122743],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00267144,"threshold_uncertainty_score":0.008936882,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1531172582","doi":"10.26493/1855-3974.406.3ec","title":"Minimal covers of equivelar toroidal maps","year":2014,"lang":"en","type":"article","venue":"Ars Mathematica Contemporanea","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Mitacs","keywords":"Toroid; Torus; Mathematics; Covering space; Cover (algebra); Euclidean geometry; Plane (geometry); Combinatorics; Geometry; Topology (electrical circuits); Physics","authors":[{"name":"Kostiantyn Drach","is_ca":false},{"name":"Mark Mixer","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04058789558511034,"gpt":0.2850834255181854,"spread":0.2444955299330751,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001769942,0.0002866564,0.0003161923,0.0008425901,0.000909604,0.001252182,0.0002839602,0.0002474562,0.002430957],"category_scores_gemma":[0.0007888859,0.0002031306,0.000353647,0.0003003067,0.0009883704,0.001148034,0.001606746,0.0004748529,0.0002937748],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005372052,"about_ca_system_score_gemma":0.0001939391,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008633306,"about_ca_topic_score_gemma":0.0006615023,"domain_scores_codex":[0.9996815,0.00003844284,0.000017333,0.00006656468,0.00009400867,0.000102221],"domain_scores_gemma":[0.9997116,0.00008248708,0.00005896897,0.00004067014,0.00003746452,0.00006886529],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001398028,0.0000243912,0.00293025,0.00007893816,0.00002181069,0.0006492697,0.0009461487,0.0044002,0.01452715,0.9610362,0.0009002223,0.01434562],"study_design_scores_gemma":[0.00004891804,0.0002157114,0.0122802,0.00007189828,0.0001191935,0.002995072,0.002340907,0.04668772,0.03546358,0.8615733,0.0381322,0.00007133843],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9399068,0.0003559989,0.02515406,0.00014555,0.00003647461,0.00001505047,0.0001322046,0.0001262341,0.03412763],"genre_scores_gemma":[0.9925033,0.0001636405,0.003310452,0.0000173578,0.00003465777,0.00001167389,0.0001374051,0.00002695089,0.003794609],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002430957,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2149893488","doi":"10.26493/1855-3974.46.b2f","title":"Deciding the deterministic property for soliton graphs","year":2009,"lang":"en","type":"article","venue":"Ars Mathematica Contemporanea","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"Deutscher Akademischer Austauschdienst","keywords":"Mathematics; Automaton; Discrete mathematics; Combinatorics; Matching (statistics); Deterministic automaton; Algorithm; Finite-state machine; Theoretical computer science; Computer science","authors":[{"name":"Miklós Bartha","is_ca":true},{"name":"Miklós Krész","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03189408691875899,"gpt":0.2634237515260707,"spread":0.2315296646073117,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002474642,0.0004207978,0.0007921378,0.0006701202,0.001718281,0.002858086,0.001528547,0.001716401,0.003487121],"category_scores_gemma":[0.0221704,0.0008067049,0.001567479,0.0007625017,0.002964404,0.00434197,0.001871688,0.002076699,0.0005434355],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001940544,"about_ca_system_score_gemma":0.002184697,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001906607,"about_ca_topic_score_gemma":0.002099916,"domain_scores_codex":[0.995461,0.0009091715,0.0005096507,0.001658456,0.000849293,0.0006123508],"domain_scores_gemma":[0.970063,0.02261177,0.001529678,0.003423684,0.001834283,0.0005375696],"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.001437417,0.0004049618,0.01110614,0.000585092,0.0001538439,0.0008410506,0.001370707,0.09693086,0.04694586,0.7281016,0.007595125,0.1045274],"study_design_scores_gemma":[0.0001348772,0.0001257779,0.0009916665,0.0000266766,0.00006057671,0.0003114986,0.0002582396,0.2188155,0.03304683,0.742559,0.003617934,0.0000514129],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.4327442,0.0001513126,0.5531496,0.001820725,0.00008972657,0.0002854693,0.000847203,0.002058672,0.00885306],"genre_scores_gemma":[0.8533682,0.0001102372,0.1417108,0.0003518997,0.00007867542,0.0002004968,0.001466342,0.0002315606,0.002481863],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003487121,"threshold_uncertainty_score":0.01407975,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2887847305","doi":"10.26493/1855-3974.1749.84e","title":"Regular self-dual and self-Petrie-dual maps of arbitrary valency","year":2019,"lang":"en","type":"article","venue":"Ars Mathematica Contemporanea","topic":"Advanced Topics in Algebra","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Banff International Research Station for Mathematical Innovation and Discovery; Vedecká Grantová Agentúra MŠVVaŠ SR a SAV; Agentúra na Podporu Výskumu a Vývoja","keywords":"Valency; Mathematics; Dual (grammatical number); Algebraic number; Prime (order theory); Combinatorics; Discrete mathematics; Mathematical analysis","authors":[{"name":"Jay Fraser","is_ca":false},{"name":"Olivia Jeans","is_ca":false},{"name":"Jozef Širáň","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02334370115602661,"gpt":0.2703586854727359,"spread":0.2470149843167093,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004948768,0.0003976879,0.0003624904,0.001457001,0.001266862,0.001860415,0.0003940195,0.0005583961,0.00268803],"category_scores_gemma":[0.001921418,0.0003580243,0.0006251825,0.0003608165,0.002290128,0.002101122,0.001639395,0.001184079,0.0004130313],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008108264,"about_ca_system_score_gemma":0.0003880212,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003450016,"about_ca_topic_score_gemma":0.0002970344,"domain_scores_codex":[0.9995323,0.00006121035,0.00002384121,0.0001458717,0.0001218719,0.0001149112],"domain_scores_gemma":[0.998912,0.0002655367,0.0001861581,0.0001132058,0.0001618855,0.0003612949],"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.0001691786,0.0000454026,0.001734273,0.00004853775,0.00001838578,0.0003579806,0.0006072276,0.002239629,0.008210894,0.9791068,0.0004402178,0.007021602],"study_design_scores_gemma":[0.00004029243,0.0001040502,0.001577283,0.00002519522,0.00003072999,0.0008009619,0.000461609,0.0152556,0.01037155,0.9622958,0.008993854,0.0000431409],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8805264,0.0002965517,0.07525057,0.000414711,0.0001830947,0.00003510182,0.0001095055,0.0001714721,0.04301266],"genre_scores_gemma":[0.9763187,0.0001429112,0.01084466,0.00007705981,0.00009952718,0.0000277577,0.000100961,0.00005932218,0.01232917],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00268803,"threshold_uncertainty_score":0.008992314,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2995405989","doi":"10.26493/1855-3974.1813.7ae","title":"Reconfiguring vertex colourings of 2-trees","year":2019,"lang":"en","type":"article","venue":"Ars Mathematica Contemporanea","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Discrete mathematics; Graph","authors":[{"name":"Michael Cavers","is_ca":true},{"name":"Karen Seyffarth","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02250036835189753,"gpt":0.266323145948113,"spread":0.2438227775962155,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002626422,0.0002908477,0.0003348262,0.0007776761,0.0008657211,0.001150807,0.0006445333,0.0005512691,0.003824393],"category_scores_gemma":[0.002078391,0.0003265484,0.0004051458,0.0007214487,0.0009646619,0.001456208,0.001311426,0.0007070845,0.0008538646],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008237895,"about_ca_system_score_gemma":0.0004665636,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001817183,"about_ca_topic_score_gemma":0.003490809,"domain_scores_codex":[0.9995492,0.00008810732,0.00002109105,0.00009438681,0.00009403237,0.000153137],"domain_scores_gemma":[0.9985651,0.0005109598,0.000180549,0.0003683248,0.000146101,0.0002290056],"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.0006088386,0.0002866783,0.006741517,0.0003022834,0.00007605044,0.001416962,0.001979064,0.1064793,0.118181,0.5942901,0.009576996,0.1600612],"study_design_scores_gemma":[0.0001314617,0.0003306356,0.004480388,0.00008659092,0.00004932334,0.0009472267,0.0005736789,0.2266224,0.03137574,0.6724026,0.06290713,0.00009286385],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7678424,0.0005129321,0.1864487,0.0003329044,0.0003217162,0.0001597527,0.0005106157,0.001399063,0.04247186],"genre_scores_gemma":[0.8693814,0.0003219554,0.1165744,0.000227672,0.00007383501,0.0001107482,0.0005219328,0.000279175,0.01250882],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003824393,"threshold_uncertainty_score":0.01279384,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2605443665","doi":"10.26493/1855-3974.1013.46a","title":"Uniformly dissociated graphs","year":2017,"lang":"en","type":"article","venue":"Ars Mathematica Contemporanea","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Saint Mary's University","funders":"Univerza v Mariboru; Javna Agencija za Raziskovalno Dejavnost RS; Simons Foundation","keywords":"Combinatorics; Mathematics; Induced subgraph; Vertex (graph theory); Discrete mathematics; Graph","authors":[{"name":"Boštjan Brešar","is_ca":false},{"name":"Bert L. Hartnell","is_ca":true},{"name":"Douglas F. Rall","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04310956707898594,"gpt":0.3163105992394612,"spread":0.2732010321604753,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003325374,0.0005623131,0.0005847929,0.001283654,0.001599504,0.001668026,0.001445607,0.0007469018,0.008441491],"category_scores_gemma":[0.002294866,0.0004144599,0.0004160019,0.001554072,0.001815456,0.003111001,0.002789684,0.001485329,0.001406443],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009451075,"about_ca_system_score_gemma":0.000475995,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001159543,"about_ca_topic_score_gemma":0.001064276,"domain_scores_codex":[0.9989423,0.0001417444,0.00006346811,0.0003846304,0.0002358369,0.0002321146],"domain_scores_gemma":[0.998105,0.0004412011,0.0003306179,0.0004683025,0.0002711762,0.0003835706],"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.0004072279,0.00005804106,0.005096265,0.0002084249,0.00005672472,0.0008149183,0.0008063015,0.01314536,0.01320723,0.9198889,0.005675545,0.04063509],"study_design_scores_gemma":[0.00005658113,0.00009509704,0.003642184,0.00006442225,0.00005935535,0.001390757,0.0009266323,0.02298074,0.007036353,0.9043676,0.05934298,0.00003743149],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6083865,0.00161661,0.2768697,0.0009872449,0.0001643549,0.0002195416,0.003651539,0.0006016566,0.1075029],"genre_scores_gemma":[0.9382078,0.0009200111,0.0368019,0.0003978386,0.0001118546,0.0001801588,0.004825439,0.0001159306,0.01843916],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008441491,"threshold_uncertainty_score":0.02823955,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2949183821","doi":"10.26493/1855-3974.1426.212","title":"On the generalized Oberwolfach problem","year":2019,"lang":"en","type":"article","venue":"Ars Mathematica Contemporanea","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; Gruppo Nazionale per le Strutture Algebriche, Geometriche e le loro Applicazioni","keywords":"Mathematics; Combinatorics; Factorization; Graph; Discrete mathematics; Algorithm","authors":[{"name":"Andrea C. Burgess","is_ca":true},{"name":"Peter Danziger","is_ca":true},{"name":"Tommaso Traetta","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01292030236419687,"gpt":0.1901795957811386,"spread":0.1772592934169417,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009019257,0.0006935645,0.0006415772,0.0007140502,0.001399572,0.001286941,0.0009949727,0.001408972,0.01330378],"category_scores_gemma":[0.00488599,0.0003371789,0.0007155157,0.001001581,0.001596657,0.003632687,0.001930752,0.00192457,0.001087691],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001111668,"about_ca_system_score_gemma":0.001280302,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004926109,"about_ca_topic_score_gemma":0.005531559,"domain_scores_codex":[0.9990439,0.0002593404,0.00003825942,0.0002156073,0.0001537371,0.0002891171],"domain_scores_gemma":[0.9980945,0.001202079,0.0001614671,0.0002233435,0.0001537491,0.0001648394],"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.0002314209,0.0001192107,0.001062225,0.0002436154,0.00004447546,0.0003734736,0.000330346,0.04646266,0.0019599,0.8660691,0.03006732,0.05303622],"study_design_scores_gemma":[0.00009495316,0.0000662775,0.0005125987,0.00004114357,0.00001732306,0.0002522788,0.0002701592,0.1164219,0.00129596,0.8681228,0.01287046,0.00003410831],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.462333,0.001202139,0.3811936,0.008791239,0.0003126011,0.0003822403,0.001921452,0.0008619014,0.1430018],"genre_scores_gemma":[0.8551502,0.0011314,0.1002621,0.001200498,0.0004945725,0.0003965151,0.002414027,0.0002077932,0.0387428],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01330378,"threshold_uncertainty_score":0.0445056,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2160085175","doi":"10.26493/1855-3974.170.fd8","title":"Maximum independent sets of the 120-cell and other regular polytopes","year":2012,"lang":"en","type":"article","venue":"Ars Mathematica Contemporanea","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Polytope; Antipodal point; Upper and lower bounds; Graph; Dodecahedron; Pairwise comparison; Discrete mathematics; Independent set; Order (exchange); Set (abstract data type); Geometry; Statistics; Computer science; Mathematical analysis","authors":[{"name":"Sean Debroni","is_ca":true},{"name":"Erin Delisle","is_ca":true},{"name":"Wendy Myrvold","is_ca":true},{"name":"Amit Sethi","is_ca":true},{"name":"Joseph Whitney","is_ca":true},{"name":"Jennifer Woodcock","is_ca":true},{"name":"Patrick W. Fowler","is_ca":false},{"name":"Benoı̂t de La Vaissière","is_ca":false},{"name":"Michel Deza","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01334276943734726,"gpt":0.1992963778698754,"spread":0.1859536084325281,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003430178,0.0003610484,0.0004134327,0.001724091,0.0008850785,0.001342708,0.0006318098,0.0003736018,0.006008187],"category_scores_gemma":[0.002576755,0.0003202494,0.0006562875,0.001511013,0.001021488,0.0009866562,0.0007248186,0.001134095,0.0007487808],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007701805,"about_ca_system_score_gemma":0.0006310933,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001663718,"about_ca_topic_score_gemma":0.001831935,"domain_scores_codex":[0.999519,0.00005967102,0.00002183661,0.00006705525,0.0002271158,0.0001053532],"domain_scores_gemma":[0.9982792,0.0008363909,0.0002018334,0.0002192498,0.0002551924,0.0002082059],"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.0003132757,0.0001645117,0.002921386,0.0003105575,0.00004857774,0.0003234089,0.0003389001,0.0773344,0.01378794,0.8432925,0.008292458,0.05287206],"study_design_scores_gemma":[0.00005468447,0.0001129156,0.003782378,0.00005623877,0.00002852302,0.0005266546,0.0002641141,0.120298,0.01413802,0.8394791,0.02119283,0.00006648595],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6879292,0.001323631,0.155137,0.0005999048,0.00007798752,0.0001172906,0.003091675,0.0004405175,0.1512827],"genre_scores_gemma":[0.9028574,0.0009583101,0.07495006,0.0001335603,0.00008172418,0.0001811452,0.002695718,0.0001711095,0.01797095],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006008187,"threshold_uncertainty_score":0.02009934,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4288050662","doi":"10.26493/1855-3974.2730.6ac","title":"Braid representatives minimizing the number of simple walks","year":2022,"lang":"en","type":"article","venue":"Ars Mathematica Contemporanea","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Universities Space Research Association; McMaster University","keywords":"Braid; Mathematics; Combinatorics; Simple (philosophy); Knot (papermaking); Permutation (music); Colored; Jones polynomial; Torus; Braid theory; Discrete mathematics; Knot theory; Braid group; Geometry","authors":[{"name":"Hans Bodén","is_ca":true},{"name":"Matthew Shimoda","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06273831897571314,"gpt":0.3450033576025214,"spread":0.2822650386268082,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006123261,0.0007396103,0.001192175,0.001551458,0.001049788,0.001645906,0.0009603708,0.0008122764,0.007775347],"category_scores_gemma":[0.004566964,0.0005004487,0.0004996262,0.00116509,0.0006470358,0.001597494,0.0006291068,0.000568256,0.00144146],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005865484,"about_ca_system_score_gemma":0.0009060256,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004448413,"about_ca_topic_score_gemma":0.001370579,"domain_scores_codex":[0.9993844,0.00009228937,0.00005428937,0.0001542118,0.0001292854,0.0001854678],"domain_scores_gemma":[0.9976729,0.001063932,0.0003227537,0.0003811086,0.000302509,0.0002568081],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001011566,0.0005966428,0.02293501,0.001166536,0.0002112759,0.0009942208,0.0008952307,0.326323,0.142956,0.2208335,0.020554,0.2615231],"study_design_scores_gemma":[0.0001481602,0.0007640579,0.008342924,0.0001266473,0.0002089047,0.001820317,0.0008651142,0.6703309,0.08073995,0.2217417,0.0147814,0.0001298567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8949065,0.0006703929,0.08148637,0.0003011475,0.0000772637,0.0001073842,0.0006817906,0.001119375,0.02064989],"genre_scores_gemma":[0.8918058,0.0004062524,0.09570935,0.00008637982,0.00003111495,0.0002052504,0.00134763,0.0007572909,0.009650897],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007775347,"threshold_uncertainty_score":0.02601111,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2783366629","doi":"10.26493/1855-3974.938.1ae","title":"On t-fold covers of coherent configurations","year":2017,"lang":"en","type":"article","venue":"Ars Mathematica Contemporanea","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"","keywords":"Mathematics; Fold (higher-order function); Combinatorics; Computer science","authors":[{"name":"A. D. Sankey","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03227526240270397,"gpt":0.2719553988205454,"spread":0.2396801364178415,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003910888,0.0004149517,0.0003349549,0.001867411,0.001541735,0.002028767,0.0004503074,0.0007872008,0.005871108],"category_scores_gemma":[0.001498771,0.0003317274,0.000481353,0.0009486462,0.001806923,0.002657348,0.002130434,0.001027895,0.0007315017],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008810917,"about_ca_system_score_gemma":0.0002935225,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006149371,"about_ca_topic_score_gemma":0.0005203045,"domain_scores_codex":[0.9994943,0.00007266462,0.0000239723,0.0001101843,0.0001150996,0.0001837601],"domain_scores_gemma":[0.999283,0.0001487164,0.0001307456,0.00009086746,0.00009697229,0.0002496524],"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.00003610222,0.00001612209,0.0008222268,0.00002057502,0.000006892175,0.0003502992,0.0003399461,0.00196646,0.004545534,0.9865628,0.0003806236,0.004952443],"study_design_scores_gemma":[0.00003475825,0.00009234052,0.002096094,0.0000484511,0.00001563731,0.000825002,0.0005962994,0.02568252,0.006106917,0.9574502,0.007014207,0.00003766419],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8793287,0.0002629851,0.07512246,0.0002639985,0.0001145901,0.00005058558,0.0001993615,0.0002000095,0.0444574],"genre_scores_gemma":[0.9835263,0.0001511272,0.008266327,0.00006836194,0.0000680202,0.00006944867,0.0001955143,0.00006947703,0.007585395],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005871108,"threshold_uncertainty_score":0.01964086,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4313589773","doi":"10.26493/1855-3974.2698.6fe","title":"An extension of the Erdős-Ko-Rado theorem to uniform set partitions","year":2023,"lang":"en","type":"article","venue":"Ars Mathematica Contemporanea","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Partition (number theory); Combinatorics; Extension (predicate logic); Block (permutation group theory); Set (abstract data type); Discrete mathematics","authors":[{"name":"Karen Meagher","is_ca":true},{"name":"Mahsa N. Shirazi","is_ca":true},{"name":"Brett Stevens","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07039809403969605,"gpt":0.3332737596129833,"spread":0.2628756655732872,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003342637,0.0006453253,0.001377871,0.002648987,0.002311276,0.002767027,0.001680909,0.001013895,0.003803186],"category_scores_gemma":[0.01080727,0.0005927227,0.001641608,0.002549046,0.004383812,0.008083344,0.004749045,0.003222368,0.0007163099],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002205822,"about_ca_system_score_gemma":0.0008936168,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001381931,"about_ca_topic_score_gemma":0.0009761429,"domain_scores_codex":[0.9972773,0.0006771841,0.0001544728,0.0006908434,0.0008036777,0.0003966151],"domain_scores_gemma":[0.9938803,0.003239952,0.0006187628,0.001079257,0.0007749069,0.0004068384],"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.00003980758,0.00001414802,0.0004050044,0.00006888046,0.00001407783,0.0001153562,0.0002168091,0.004499656,0.0008843882,0.9849186,0.001263598,0.007559832],"study_design_scores_gemma":[0.00002751321,0.00005656251,0.0006929954,0.00006021007,0.00002706375,0.0004861582,0.0001510251,0.0297689,0.001429139,0.9502977,0.01697114,0.0000317725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.1672141,0.00410728,0.7290615,0.002434961,0.0004520686,0.0001906633,0.0008090483,0.0003835757,0.09534685],"genre_scores_gemma":[0.8540718,0.003645409,0.1259929,0.0009986437,0.0008237794,0.000360187,0.0005239517,0.0001864327,0.01339691],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.003803186,"threshold_uncertainty_score":0.01767778,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3039500359","doi":"10.26493/1855-3974.2374.9ff","title":"New results on modular Golomb rulers, optical orthogonal codes and related structures","year":2020,"lang":"en","type":"preprint","venue":"Ars Mathematica Contemporanea","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"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":"Golomb coding; Modular design; Mathematics; Combinatorics; Order (exchange); Discrete mathematics; Computer science; Image (mathematics); Programming language; Business","authors":[{"name":"Marco Buratti","is_ca":false},{"name":"Douglas R. Stinson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02061389483583256,"gpt":0.2228567650690206,"spread":0.202242870233188,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001290118,0.0006616079,0.0005754673,0.002285163,0.001320617,0.001867065,0.0009832981,0.001103068,0.004590145],"category_scores_gemma":[0.006138834,0.0004432875,0.0007139028,0.00113043,0.002858794,0.005410769,0.001858229,0.002210928,0.0006672442],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007407816,"about_ca_system_score_gemma":0.0004159703,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002497211,"about_ca_topic_score_gemma":0.0003005461,"domain_scores_codex":[0.998962,0.0001689377,0.0000750237,0.0002290791,0.0004298877,0.0001350657],"domain_scores_gemma":[0.9957868,0.002500232,0.0005009749,0.0004537702,0.0005600165,0.0001981182],"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.00003486861,0.00003276249,0.001043038,0.000196168,0.00001254438,0.000320647,0.0002814526,0.003563219,0.005016356,0.9705821,0.001253541,0.01766332],"study_design_scores_gemma":[0.00001540313,0.00007851219,0.0008150137,0.00007051183,0.00002159765,0.001234616,0.000282219,0.0180633,0.006612369,0.9608349,0.01193796,0.000033672],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3611316,0.00619277,0.4788738,0.002207103,0.0005669158,0.0001093437,0.0004308437,0.0003197045,0.150168],"genre_scores_gemma":[0.8784931,0.003076219,0.09996215,0.0005138599,0.0006240814,0.0001348904,0.000366424,0.0001064035,0.01672281],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004590145,"threshold_uncertainty_score":0.01535559,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4414100071","doi":"10.26493/1855-3974.3451.46f","title":"Extending graph burning to hypergraphs","year":2025,"lang":"en","type":"article","venue":"Ars Mathematica Contemporanea","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland; Toronto Metropolitan University; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hypergraph; Graph; Conjecture; Generalization; Existential quantification; Upper and lower bounds","authors":[{"name":"Andrea C. Burgess","is_ca":true},{"name":"Caleb Jones","is_ca":true},{"name":"David A. Pike","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01258541289274254,"gpt":0.2570222555429517,"spread":0.2444368426502091,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001459227,0.0006458853,0.0006150476,0.0009396376,0.001138636,0.002021819,0.001717843,0.001221415,0.006365962],"category_scores_gemma":[0.006651936,0.0004902862,0.001106032,0.001096888,0.003590821,0.005992173,0.003165272,0.003420044,0.0007538656],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001676334,"about_ca_system_score_gemma":0.0007970253,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002077594,"about_ca_topic_score_gemma":0.001912766,"domain_scores_codex":[0.998747,0.000476918,0.00004396852,0.0003409662,0.0002493817,0.0001417129],"domain_scores_gemma":[0.9958455,0.002346991,0.0003567211,0.0009015458,0.0002214364,0.0003277993],"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.00003076301,0.00003337663,0.0002759416,0.00004961904,0.00001341789,0.00007589964,0.0002310897,0.03791582,0.001500352,0.9488499,0.0008086995,0.01021514],"study_design_scores_gemma":[0.00001412344,0.00001795403,0.00008736864,0.00001430273,0.000008388121,0.00004753074,0.00004840464,0.113543,0.000710043,0.8811178,0.00437981,0.00001123478],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09001614,0.000654312,0.8691031,0.001253489,0.0001157189,0.0001329951,0.0002004009,0.0004869236,0.03803689],"genre_scores_gemma":[0.7844237,0.001058046,0.1922634,0.0006862615,0.0002334531,0.0003070931,0.000222192,0.0003506321,0.02045525],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006365962,"threshold_uncertainty_score":0.02129626,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3206898017","doi":"10.26493/1855-3974.2724.83d","title":"The search for small association schemes with noncyclotomic eigenvalues","year":2022,"lang":"en","type":"article","venue":"Ars Mathematica Contemporanea","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Association scheme; Eigenvalues and eigenvectors; Rank (graph theory); Commutative property; Algebraic number; Table (database); Pure mathematics; Algebra over a field; Discrete mathematics; Combinatorics; Mathematical analysis","authors":[{"name":"Allen Herman","is_ca":true},{"name":"Roghayeh Maleki","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02429570271976519,"gpt":0.2363736229793525,"spread":0.2120779202595874,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001113547,0.0004828226,0.0007288734,0.001175756,0.00137403,0.002109633,0.0007683599,0.0009227514,0.008213092],"category_scores_gemma":[0.006512233,0.0006074379,0.0006019842,0.0006505446,0.00202801,0.003568296,0.00183916,0.001501781,0.0008786592],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005384322,"about_ca_system_score_gemma":0.0006414399,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001317477,"about_ca_topic_score_gemma":0.0003173045,"domain_scores_codex":[0.9992768,0.0001848207,0.000052924,0.0001494141,0.0002229523,0.0001130434],"domain_scores_gemma":[0.9964182,0.001877665,0.0006485928,0.0006109764,0.0001886922,0.0002558575],"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.0001781387,0.00007782149,0.002548693,0.0001847554,0.00003129446,0.0002756226,0.0004336977,0.018162,0.01417771,0.942785,0.0007886302,0.02035666],"study_design_scores_gemma":[0.00009697676,0.0002092668,0.0009694672,0.00008368183,0.00004524787,0.0005363588,0.0007689865,0.05564493,0.01609291,0.9153199,0.01016718,0.00006510191],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8148682,0.0003886417,0.1630322,0.0005855211,0.00003554711,0.00009148064,0.0001555215,0.0002092216,0.02063376],"genre_scores_gemma":[0.9211586,0.0001582375,0.07566663,0.00004387898,0.00002740853,0.00008921559,0.000173797,0.00006222939,0.002619999],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008213092,"threshold_uncertainty_score":0.0274756,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4412409721","doi":"10.26493/1855-3974.3365.d2c","title":"Centrality in connected graphs via convexity or concavity","year":2025,"lang":"en","type":"article","venue":"Ars Mathematica Contemporanea","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Mathematics; Convexity; Centrality; Combinatorics; Discrete mathematics; Business","authors":[{"name":"Dinesh Pandey","is_ca":true},{"name":"Kamal Lochan Patra","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05923040225344551,"gpt":0.3431340895196857,"spread":0.2839036872662402,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001052519,0.0004757105,0.0007651577,0.001609893,0.001078192,0.002069775,0.0008508608,0.0006685166,0.002701243],"category_scores_gemma":[0.007151546,0.0003852246,0.0005644223,0.001763187,0.003786837,0.003236455,0.001265496,0.001684895,0.000393632],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001625312,"about_ca_system_score_gemma":0.0006335661,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002320304,"about_ca_topic_score_gemma":0.002109965,"domain_scores_codex":[0.9990651,0.0003258801,0.00002411628,0.0002647429,0.0002248762,0.00009538746],"domain_scores_gemma":[0.9949504,0.003386869,0.0005890645,0.000385548,0.0004444864,0.000243496],"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.00003305706,0.00001468068,0.001143563,0.0000613247,0.00001966625,0.0001402343,0.0003362963,0.01495528,0.001730844,0.9683506,0.001841777,0.01137274],"study_design_scores_gemma":[0.00001126716,0.0000224374,0.001425879,0.00001890875,0.00001695949,0.000251428,0.0001421868,0.09773288,0.001117437,0.8936434,0.005599532,0.00001757568],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2866677,0.001478161,0.652539,0.002758218,0.00009046576,0.00008320564,0.0004013006,0.0003854206,0.05559661],"genre_scores_gemma":[0.9429814,0.00110075,0.04884056,0.0003549199,0.0002656152,0.0001056152,0.000249964,0.0001530824,0.005948071],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002701243,"threshold_uncertainty_score":0.01179254,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4400497258","doi":"10.26493/1855-3974.3130.d46","title":"On optimal λ-separable packings in the plane","year":2024,"lang":"en","type":"article","venue":"Ars Mathematica Contemporanea","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"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; Nemzeti Kutatási Fejlesztési és Innovációs Hivatal","keywords":"Mathematics; Separable space; Combinatorics; Plane (geometry); Geometry; Mathematical analysis","authors":[{"name":"Károly Bezdek","is_ca":false},{"name":"Zsolt Lángi","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0178206220213836,"gpt":0.2376500779280692,"spread":0.2198294559066856,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00153262,0.001001671,0.001299289,0.00212277,0.001220123,0.002595574,0.001252498,0.0006412355,0.003302286],"category_scores_gemma":[0.01076493,0.0009582657,0.000558046,0.002071255,0.002341317,0.003917342,0.002375418,0.00115929,0.000596008],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002263303,"about_ca_system_score_gemma":0.0005909894,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002897649,"about_ca_topic_score_gemma":0.001373627,"domain_scores_codex":[0.9985378,0.0002741728,0.00009565349,0.0002014108,0.0004935454,0.000397371],"domain_scores_gemma":[0.9955721,0.002297094,0.0007847607,0.0004939343,0.0004067882,0.0004452798],"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.000968174,0.000215603,0.003542943,0.0003361909,0.00005845633,0.0003161995,0.0007625696,0.214335,0.01326159,0.7046664,0.00407195,0.05746481],"study_design_scores_gemma":[0.0000653086,0.0002256355,0.002462493,0.0000954345,0.00002445096,0.0002520965,0.0005407906,0.6042941,0.008296385,0.3792673,0.004416351,0.00005959087],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6597965,0.002557047,0.3097714,0.0003781943,0.0000736207,0.0001005532,0.0004585008,0.0003452103,0.02651895],"genre_scores_gemma":[0.9520732,0.001685229,0.04325757,0.00009139734,0.00007550344,0.0001084476,0.0004068821,0.00009843055,0.002203365],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003302286,"threshold_uncertainty_score":0.0164215,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4408720272","doi":"10.26493/1855-3974.3471.51f","title":"Decompositions of the wreath product of certain directed graphs into directed hamiltonian cycles","year":2025,"lang":"en","type":"article","venue":"Ars Mathematica Contemporanea","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"","keywords":"Wreath product; Mathematics; Combinatorics; Directed graph; Product (mathematics); Hamiltonian (control theory); Discrete mathematics; Geometry; Mathematical optimization","authors":[{"name":"Alice Lacaze‐Masmonteil","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007890167093602561,"gpt":0.2210453852020529,"spread":0.2131552181084503,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005884366,0.0004965239,0.0003681501,0.001280247,0.0007646588,0.001256343,0.0008745952,0.0005119814,0.007538706],"category_scores_gemma":[0.00277065,0.0005086683,0.0007984324,0.0009810088,0.001481112,0.002948203,0.001138345,0.001468504,0.0005871111],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004904514,"about_ca_system_score_gemma":0.0002582875,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005884205,"about_ca_topic_score_gemma":0.0007676898,"domain_scores_codex":[0.9993881,0.000117944,0.00004155823,0.0002010041,0.0001420815,0.0001092379],"domain_scores_gemma":[0.9977474,0.0009026389,0.0004551111,0.0003834207,0.0002217817,0.0002897244],"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.0000987498,0.00005239383,0.001104408,0.0001839247,0.0000388831,0.0006548795,0.0007516405,0.01227845,0.005723657,0.9531337,0.001891615,0.02408773],"study_design_scores_gemma":[0.00003118359,0.00005859528,0.0006781706,0.00003292699,0.00003001131,0.000580546,0.0002958422,0.03820392,0.00414728,0.9471878,0.008735285,0.00001836308],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5570344,0.0008101626,0.3883006,0.0005896276,0.000115527,0.000186905,0.0006874223,0.0002464997,0.05202873],"genre_scores_gemma":[0.887931,0.0007194109,0.09583514,0.0002102786,0.0001369324,0.0001437245,0.001038994,0.0001545993,0.01383001],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007538706,"threshold_uncertainty_score":0.0252195,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4394880856","doi":"10.26493/1855-3974.3087.f36","title":"Z_3^8 is not a CI-group","year":2024,"lang":"en","type":"article","venue":"Ars Mathematica Contemporanea","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Lethbridge","funders":"","keywords":"Mathematics; Combinatorics; Group (periodic table); Chemistry","authors":[{"name":"Joy Morris","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0324005936871241,"gpt":0.283248272130124,"spread":0.2508476784429999,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003221317,0.0004009073,0.0006672649,0.0006359257,0.001490065,0.001977182,0.0005122027,0.0006440507,0.01603957],"category_scores_gemma":[0.0007697461,0.0002322593,0.0005489581,0.0006157755,0.002282313,0.002210729,0.001220156,0.001552095,0.002039333],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001373317,"about_ca_system_score_gemma":0.0007983624,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002062782,"about_ca_topic_score_gemma":0.00175504,"domain_scores_codex":[0.9995121,0.0000479294,0.00002734508,0.0001547372,0.0001144663,0.0001435222],"domain_scores_gemma":[0.9995006,0.0001241242,0.0001017017,0.00007279798,0.0001114187,0.00008924841],"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.0001906448,0.00003225112,0.0006849014,0.00007978977,0.00002473703,0.0003325173,0.0002593132,0.0003947621,0.004025782,0.9684823,0.00533108,0.02016208],"study_design_scores_gemma":[0.0001080837,0.00008937397,0.001628427,0.00003200628,0.00003805148,0.0006610238,0.0005144713,0.002202745,0.007545541,0.7912933,0.1958423,0.00004473212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.4463706,0.001361066,0.06911269,0.00631903,0.001452298,0.0001539239,0.001361304,0.001174102,0.4726948],"genre_scores_gemma":[0.892448,0.0006849236,0.02310389,0.0009326484,0.0002403037,0.0001194433,0.001393136,0.0001879419,0.08088958],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01603957,"threshold_uncertainty_score":0.05365777,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3043264869","doi":"10.26493/1855-3974.1685.395","title":"Incidence structures near configurations of type (n_3)","year":2020,"lang":"en","type":"article","venue":"Ars Mathematica Contemporanea","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Incidence (geometry); Euclidean geometry; Type (biology); Hypergraph; Line (geometry); Projective plane; Discrete mathematics; Geometry","authors":[{"name":"Peter J. Dukes","is_ca":true},{"name":"Kaoruko Iwasaki","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02449856267701302,"gpt":0.22336806235403,"spread":0.1988694996770169,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000264497,0.0002409926,0.0002877487,0.001061568,0.001470847,0.001998387,0.0005831398,0.0008847745,0.007674302],"category_scores_gemma":[0.001539509,0.0003548387,0.0003856088,0.0006703457,0.001610952,0.001725398,0.001426041,0.001360515,0.0008259746],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008433259,"about_ca_system_score_gemma":0.000301135,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001059231,"about_ca_topic_score_gemma":0.001391134,"domain_scores_codex":[0.9996562,0.00006225507,0.0000162953,0.00008733452,0.00005622824,0.0001216555],"domain_scores_gemma":[0.9988725,0.0003365772,0.0002719689,0.0001693797,0.0001076312,0.000242001],"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.0002120492,0.00006586787,0.003945619,0.00004088144,0.0000147177,0.0008696412,0.0005446023,0.006765613,0.008355241,0.9637226,0.002453551,0.01300961],"study_design_scores_gemma":[0.00006224655,0.00008359183,0.003637117,0.00002838907,0.0000173842,0.0009748882,0.0008940939,0.03674417,0.007420312,0.9441678,0.00592606,0.0000437823],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9051589,0.00008246296,0.04819236,0.0003552919,0.0000945265,0.00002609389,0.0002404144,0.0002233867,0.04562665],"genre_scores_gemma":[0.9853661,0.00004561649,0.007816195,0.00006720528,0.00003747596,0.00002595646,0.0001819556,0.00004219873,0.006417261],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007674302,"threshold_uncertainty_score":0.02567309,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4317617507","doi":"10.26493/1855-3974.2853.b51","title":"Domination and independence number of large 2-crossing-critical graphs","year":2023,"lang":"en","type":"article","venue":"Ars Mathematica Contemporanea","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Javna Agencija za Raziskovalno Dejavnost RS; Simon Fraser University","keywords":"Independence number; Mathematics; Combinatorics; Domination analysis; Independence (probability theory); Subfamily; Crossing number (knot theory); Upper and lower bounds; Discrete mathematics; Graph; Statistics; Geography; Vertex (graph theory)","authors":[{"name":"Vesna Iršič","is_ca":false},{"name":"Maruša Lekše","is_ca":false},{"name":"Mihael Pačnik","is_ca":false},{"name":"Petra Podlogar","is_ca":false},{"name":"Martin Praček","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03054575374732277,"gpt":0.3541777078688711,"spread":0.3236319541215483,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007120123,0.0006492569,0.0004367389,0.002935834,0.0009593419,0.001362584,0.0009010946,0.000475725,0.003398327],"category_scores_gemma":[0.007173557,0.0003964875,0.0003968963,0.001186537,0.001863358,0.001590577,0.001133866,0.001623684,0.0003064516],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001028914,"about_ca_system_score_gemma":0.0003720117,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001092682,"about_ca_topic_score_gemma":0.001695287,"domain_scores_codex":[0.9995489,0.00008880407,0.00001296098,0.0001215641,0.0001185082,0.0001092092],"domain_scores_gemma":[0.9919559,0.005837508,0.0006075433,0.000317926,0.0003647567,0.000916278],"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.00084104,0.0001790025,0.02697003,0.0005828659,0.0001784658,0.001128036,0.001359743,0.06537414,0.04120756,0.7996013,0.01357228,0.04900546],"study_design_scores_gemma":[0.00005573808,0.00007456915,0.01910232,0.0001086735,0.000100114,0.001266929,0.0002679048,0.1621232,0.01030919,0.7973003,0.009212348,0.00007866703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.867873,0.002569936,0.07092644,0.001068523,0.00007910291,0.00004142584,0.0008927179,0.0002928165,0.05625604],"genre_scores_gemma":[0.9893545,0.0009154195,0.006185455,0.0001053442,0.0001148026,0.00004417178,0.0004385544,0.00005578881,0.002786089],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003398327,"threshold_uncertainty_score":0.01136857,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4385585618","doi":"10.26493/1855-3974.2835.8f0","title":"On the minisymposium problem","year":2023,"lang":"en","type":"article","venue":"Ars Mathematica Contemporanea","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; University of Toronto; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Gruppo Nazionale per le Strutture Algebriche, Geometriche e le loro Applicazioni","keywords":"Combinatorics; Mathematics; Context (archaeology); Factorization; Graph; Discrete mathematics; Algorithm","authors":[{"name":"Peter Danziger","is_ca":true},{"name":"Eric Mendelsohn","is_ca":true},{"name":"Brett Stevens","is_ca":true},{"name":"Tommaso Traetta","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01847883366024592,"gpt":0.2044635259647958,"spread":0.1859846923045498,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002160761,0.002071825,0.001849734,0.001168836,0.002779936,0.003231545,0.003181621,0.002628501,0.02843782],"category_scores_gemma":[0.01010642,0.00102679,0.001958762,0.002085554,0.002651891,0.01151548,0.004436408,0.005369988,0.00447213],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001948219,"about_ca_system_score_gemma":0.002251241,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002318375,"about_ca_topic_score_gemma":0.0022657,"domain_scores_codex":[0.9966735,0.0009862737,0.0001672485,0.0009563146,0.0006054352,0.0006111813],"domain_scores_gemma":[0.995461,0.002185247,0.0003415599,0.0009729099,0.0004979816,0.0005412967],"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.0004277581,0.0002370499,0.001028261,0.0004141807,0.00007221282,0.0002769814,0.0003854577,0.02439488,0.001629791,0.8228198,0.06034618,0.08796742],"study_design_scores_gemma":[0.00009237899,0.00007448907,0.0002836659,0.00006294944,0.00002368666,0.000244332,0.0002029619,0.04724497,0.0009431058,0.924355,0.0264362,0.00003638352],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1572521,0.002793403,0.668963,0.01067823,0.001128823,0.0006880388,0.002892169,0.002007845,0.1535965],"genre_scores_gemma":[0.5759993,0.00376548,0.3158226,0.004782511,0.002315891,0.001248302,0.01084179,0.001611649,0.08361261],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02843782,"threshold_uncertainty_score":0.09513402,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4405650678","doi":"10.26493/1855-3974.3282.6ea","title":"Tight upper bounds for the p-anionic Clar number of fullerenes","year":2024,"lang":"en","type":"article","venue":"Ars Mathematica Contemporanea","topic":"Fullerene Chemistry and Applications","field":"Chemistry","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Leverhulme Trust","keywords":"Fullerene; Combinatorics; Mathematics; Upper and lower bounds; Chemistry; Mathematical analysis; Organic chemistry","authors":[{"name":"Aaron Slobodin","is_ca":true},{"name":"Wendy Myrvold","is_ca":true},{"name":"Gary MacGillivray","is_ca":true},{"name":"Patrick W. Fowler","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02638621480805793,"gpt":0.2921125223561837,"spread":0.2657263075481258,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003163802,0.002792464,0.00185315,0.005464232,0.003550975,0.006530272,0.004047893,0.002611028,0.01461412],"category_scores_gemma":[0.02450026,0.001794951,0.001425862,0.004193127,0.005118292,0.0144632,0.00679975,0.007485666,0.003388809],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004211202,"about_ca_system_score_gemma":0.001099705,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00201533,"about_ca_topic_score_gemma":0.003009709,"domain_scores_codex":[0.9951585,0.0005434108,0.0001682835,0.0009759195,0.001670219,0.001483603],"domain_scores_gemma":[0.9815866,0.01272808,0.001268211,0.001797226,0.001148112,0.001471751],"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.000699533,0.0002996148,0.003416641,0.0008726884,0.0001080212,0.0005483949,0.0006343136,0.02843219,0.009460638,0.8737016,0.0187508,0.06307564],"study_design_scores_gemma":[0.0000458866,0.0001457141,0.002147948,0.0003481687,0.000106513,0.0006934117,0.0001802101,0.0495845,0.00932768,0.9081348,0.0291528,0.0001323537],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.2795978,0.03169247,0.3253593,0.009698302,0.001279897,0.0002198206,0.00361055,0.002003668,0.3465382],"genre_scores_gemma":[0.9074306,0.01155854,0.05665204,0.00146352,0.001355197,0.0003660247,0.001933396,0.0005417528,0.01869895],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01461412,"threshold_uncertainty_score":0.04888904,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2972549413","doi":"10.26493/1855-3974.2260.c0e","title":"A generalization of balanced tableaux and marriage problems with unique solutions","year":2021,"lang":"en","type":"preprint","venue":"Ars Mathematica Contemporanea","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"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":"Generalization; Combinatorics; Hook; Mathematics; Characterization (materials science); Young tableau; Pure mathematics; Discrete mathematics; Mathematical analysis; Physics","authors":[{"name":"Brian T. Chan","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05881974860328973,"gpt":0.2875260405306049,"spread":0.2287062919273152,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007320927,0.0002447085,0.0005272289,0.0006085664,0.001197896,0.001009972,0.000777379,0.0008345235,0.004297665],"category_scores_gemma":[0.003577118,0.0002248014,0.0005926648,0.0007169044,0.001416669,0.00327329,0.001109382,0.0009301344,0.0001916006],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001141594,"about_ca_system_score_gemma":0.0004406708,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008240427,"about_ca_topic_score_gemma":0.001075895,"domain_scores_codex":[0.9995204,0.00008627799,0.00003049327,0.0001983001,0.00009509306,0.00006942358],"domain_scores_gemma":[0.9988451,0.0005326845,0.000195999,0.0001772192,0.0001225285,0.0001264044],"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.00003422756,0.00002260505,0.001593283,0.00004679487,0.00001372867,0.0002073432,0.0003180937,0.006415756,0.003131943,0.9766554,0.0007326493,0.01082823],"study_design_scores_gemma":[0.00002548779,0.00006865435,0.001814403,0.00002525354,0.0000200256,0.0006497277,0.0003451357,0.05891459,0.002649016,0.928874,0.006589448,0.00002421952],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7171115,0.0008013963,0.2523184,0.001156322,0.0001049484,0.00008384616,0.0003837116,0.00009981393,0.02794011],"genre_scores_gemma":[0.9527452,0.0002954298,0.03982326,0.0001502784,0.00006919407,0.00007754084,0.0001666099,0.00001807274,0.006654421],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004297665,"threshold_uncertainty_score":0.01437718,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}