{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006862397,0.0002012772,0.0003039095,0.0001250854,0.0001528263,0.00007176751,0.0007710471,0.00007480984,0.00003150461],"category_scores_gemma":[0.00009675308,0.00016547,0.0001861412,0.0002810607,0.0001043053,0.000289905,0.00008984809,0.00008471234,0.000142417],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008255348,"about_ca_system_score_gemma":0.00004161703,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003544429,"about_ca_topic_score_gemma":0.00001105392,"domain_scores_codex":[0.9985141,0.00004358344,0.0004409606,0.0004163636,0.0002324862,0.000352494],"domain_scores_gemma":[0.9985133,0.0001910458,0.000182234,0.000803874,0.0001499524,0.0001595435],"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.00001032071,0.0001399252,0.000139481,0.00007212693,0.000040265,0.00000762718,0.00265569,5.310366e-7,0.0006279692,0.9911196,0.004571015,0.0006154693],"study_design_scores_gemma":[0.0007114709,0.0001145694,0.00002537445,0.00006708618,0.00001713526,0.00002221865,0.00008673798,0.003218923,0.003392676,0.9908221,0.001272042,0.0002496208],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07275771,0.0003951775,0.8319501,0.002199378,0.00121089,0.002064733,0.00002756271,0.001667572,0.08772683],"genre_scores_gemma":[0.8024287,0.000005527004,0.1964199,0.000444837,0.000002420175,0.0001023897,0.000002958375,0.0000207288,0.0005725297],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.729671,"threshold_uncertainty_score":0.674767,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001370741,0.0007368454,0.001153429,0.0003562543,0.0004557559,0.0004469105,0.001052998,0.0002423837,0.0009014538],"category_scores_gemma":[0.0007525185,0.0005437364,0.0002894354,0.0006059532,0.0005635587,0.0004149761,0.0001966155,0.0007848045,0.002151782],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001480682,"about_ca_system_score_gemma":0.00007362916,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001661885,"about_ca_topic_score_gemma":0.0001238738,"domain_scores_codex":[0.9953283,0.0005117705,0.001016864,0.0007669196,0.001307443,0.001068679],"domain_scores_gemma":[0.9939334,0.002481163,0.0005833796,0.002123307,0.0003619839,0.0005168016],"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.0006221848,0.003511165,0.004594156,0.002333354,0.0009087969,0.0005603873,0.008622685,0.000005322352,0.0033525,0.9417958,0.0324834,0.001210204],"study_design_scores_gemma":[0.003078658,0.0009300612,0.001737036,0.001201662,0.00008955812,0.0001907851,0.004423796,0.0005284263,0.001463334,0.9846662,0.0006060348,0.001084485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9619633,0.00006833245,0.0009200922,0.001792813,0.0001065759,0.00283101,0.00003973407,0.000548713,0.0317294],"genre_scores_gemma":[0.9895041,0.00001002034,0.006086391,0.0005357381,0.00004626836,0.0006959424,0.0000220461,0.0002385636,0.002860907],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04287032,"threshold_uncertainty_score":0.9997014,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003574735,0.0003459602,0.000854053,0.0003454928,0.00008614636,0.00005039047,0.0009127773,0.0001781086,0.0004558284],"category_scores_gemma":[0.006210775,0.0002946914,0.0002185186,0.0005045666,0.0003307427,0.0001864157,0.0002581983,0.0003606364,0.000372245],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008672856,"about_ca_system_score_gemma":0.000182244,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004172212,"about_ca_topic_score_gemma":0.00001785859,"domain_scores_codex":[0.9965122,0.000417949,0.0009388412,0.0004115363,0.001186307,0.0005331893],"domain_scores_gemma":[0.9937652,0.003600647,0.000445573,0.001376074,0.0004584704,0.0003540751],"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.0002197477,0.0005846569,0.0001746955,0.0005565297,0.0001323411,0.00006785054,0.003579773,0.000005852571,0.001546561,0.9669359,0.02605756,0.0001384997],"study_design_scores_gemma":[0.001632133,0.0004937934,0.00001766358,0.0003793341,0.00004290386,0.00002981098,0.0008844227,0.001374338,0.004200539,0.9903084,0.0003680646,0.0002685791],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8637185,0.00009582875,0.001834246,0.0008845513,0.0001968793,0.00130887,0.00004531832,0.0003390228,0.1315768],"genre_scores_gemma":[0.984053,0.00000325444,0.01305199,0.0001010202,0.00001997042,0.00008840107,0.000008595657,0.00009756742,0.002576247],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1290005,"threshold_uncertainty_score":0.9999505,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001064254,0.0002586911,0.0007745905,0.0001988371,0.00006666967,0.00001760126,0.0003996217,0.0001576679,0.0005926885],"category_scores_gemma":[0.002273223,0.0002221623,0.0002123026,0.0002875193,0.0002654617,0.0001101552,0.0001103468,0.0001535252,0.0001826221],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002637518,"about_ca_system_score_gemma":0.00005217368,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002096057,"about_ca_topic_score_gemma":0.00000545795,"domain_scores_codex":[0.9979563,0.00014339,0.0007997351,0.0003036097,0.0004063343,0.0003906493],"domain_scores_gemma":[0.9967814,0.001882437,0.0004638575,0.000607279,0.000125651,0.0001393578],"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.00005360814,0.0003305595,0.000479126,0.0004710964,0.0001337097,0.00001078574,0.001355598,7.719382e-7,0.002172132,0.9828563,0.01124143,0.0008948377],"study_design_scores_gemma":[0.001971707,0.0004399499,0.000142421,0.0001339347,0.0001183046,0.00005651486,0.0009995495,0.0002921852,0.005123502,0.9825181,0.007803836,0.0003999761],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8323634,0.0001357555,0.02783298,0.0009802328,0.0003415768,0.0006476484,0.0000406239,0.0002059967,0.1374517],"genre_scores_gemma":[0.9807283,0.000004543353,0.01669927,0.0001255922,0.00005389584,0.0000195003,0.000006861731,0.00004080231,0.002321226],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1483649,"threshold_uncertainty_score":0.9059514,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009005176,0.0001937705,0.0002727163,0.00005834688,0.0002919057,0.0002587119,0.00119375,0.00005104787,0.00000701221],"category_scores_gemma":[0.0002445427,0.00009816316,0.000160753,0.0001880027,0.0000730393,0.0003025943,0.0000757985,0.00008935814,0.00004042886],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001643283,"about_ca_system_score_gemma":0.00004632676,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000303611,"about_ca_topic_score_gemma":0.000001118764,"domain_scores_codex":[0.9986337,0.00006741668,0.0003846991,0.0003349119,0.0002296699,0.0003496258],"domain_scores_gemma":[0.998171,0.0006637265,0.0001601685,0.0008551709,0.00006852565,0.00008145726],"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.00001458175,0.0001182653,0.000009563149,0.00006324844,0.00002397135,0.00001530854,0.001882194,0.000002013845,0.002893689,0.9449989,0.002792129,0.04718611],"study_design_scores_gemma":[0.000496422,0.0002169604,0.00007568919,0.0001312407,0.00002038679,0.00007725044,0.000139382,0.0758396,0.002627518,0.9161336,0.003972218,0.0002696743],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03769801,0.0003182944,0.9332932,0.010328,0.0004526177,0.001939322,0.000007287481,0.0007082267,0.0152551],"genre_scores_gemma":[0.9753901,0.000005020714,0.02255124,0.001393099,0.00003467964,0.00008040215,0.000001744603,0.00001325436,0.0005304142],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9376921,"threshold_uncertainty_score":0.4002978,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009723895,0.0004322956,0.0009785736,0.0001793537,0.00007975273,0.00003827192,0.0003204246,0.0002267834,0.0002285235],"category_scores_gemma":[0.0004835729,0.0003969585,0.0001807666,0.0002715534,0.000151551,0.0003448891,0.0002176782,0.0003517725,0.000152661],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005303891,"about_ca_system_score_gemma":0.0001095455,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003088727,"about_ca_topic_score_gemma":0.000001441151,"domain_scores_codex":[0.9970831,0.0001538461,0.001090893,0.0005516722,0.0006626277,0.0004578921],"domain_scores_gemma":[0.9963537,0.001518366,0.000608017,0.001178498,0.0001676305,0.0001738173],"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.00003338662,0.000778517,0.0007989937,0.002980078,0.0003166074,0.00005910585,0.003599853,2.40033e-7,0.00122797,0.9884076,0.001633873,0.0001637411],"study_design_scores_gemma":[0.001632118,0.0002413564,0.00006619752,0.0003740664,0.000159887,0.0001693139,0.0006045874,0.0002065004,0.005111758,0.9878412,0.003115655,0.0004773336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9573485,0.0005959887,0.001334674,0.0003876495,0.0002922188,0.00153779,0.00005968507,0.0006246453,0.03781883],"genre_scores_gemma":[0.7600374,0.0001010434,0.2367685,0.0001227429,0.00008369266,0.00004823778,0.00001690334,0.0001417825,0.002679712],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2354339,"threshold_uncertainty_score":0.9998482,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007391285,0.0001583507,0.0003909455,0.0001719481,0.00004755361,0.00005064441,0.001192585,0.00005607151,0.0001491333],"category_scores_gemma":[0.0001622273,0.0001417534,0.0001157911,0.0003419644,0.0000994883,0.0004847408,0.00024267,0.0001501743,0.0004843851],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002338866,"about_ca_system_score_gemma":0.00005735237,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006423927,"about_ca_topic_score_gemma":0.000003553095,"domain_scores_codex":[0.9984031,0.00008405259,0.0004236063,0.000359191,0.0004031459,0.0003269113],"domain_scores_gemma":[0.9979501,0.0005892352,0.000204939,0.001028241,0.0001273552,0.0001000914],"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.00003468187,0.0001434679,0.001605979,0.0003333,0.00006766077,0.00002048257,0.001813914,0.00002189535,0.03524408,0.9570064,0.0002636595,0.003444452],"study_design_scores_gemma":[0.001931197,0.0004596042,0.001219501,0.0006374445,0.00001199927,0.00006400825,0.000444086,0.01803875,0.1008771,0.8734851,0.002221101,0.0006100167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8513985,0.000189317,0.05773285,0.0006941975,0.0002618443,0.0009523171,0.00000421839,0.0002688355,0.08849789],"genre_scores_gemma":[0.9819563,0.000007029419,0.01569198,0.00005421021,0.000004773661,0.00002003182,7.600436e-7,0.00001788544,0.002247041],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1305578,"threshold_uncertainty_score":0.6225951,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009976705,0.0002087736,0.0003393127,0.0001316476,0.0008345318,0.0005853691,0.003236374,0.00007653018,0.00003705902],"category_scores_gemma":[0.0006990471,0.0001761763,0.0001515981,0.0001850929,0.0003227899,0.001275194,0.0005763095,0.0002137578,0.0003534398],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002838703,"about_ca_system_score_gemma":0.00006815224,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001650419,"about_ca_topic_score_gemma":0.00001233629,"domain_scores_codex":[0.9981582,0.00009201376,0.0003472612,0.000418287,0.0004939605,0.0004902397],"domain_scores_gemma":[0.9965479,0.0002760409,0.0003440138,0.00247628,0.0001586963,0.0001970807],"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.000009494806,0.00008290092,0.0007109906,0.00003708447,0.00004407799,0.00005930863,0.0005952814,6.459272e-7,0.0007435612,0.9935766,0.0004969565,0.00364306],"study_design_scores_gemma":[0.0006438103,0.00006257448,0.001277264,0.00007498489,0.000005851467,0.00001885034,0.00006500399,0.003163062,0.00144905,0.991788,0.001183312,0.0002682729],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2130933,0.0002910442,0.4447365,0.01099934,0.0007660992,0.001885835,0.00002660935,0.001476563,0.3267247],"genre_scores_gemma":[0.9817305,0.00001417535,0.01551126,0.0001030621,0.00001092117,0.00004036125,0.000002246415,0.0000224054,0.002565033],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7686373,"threshold_uncertainty_score":0.7184261,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005567102,0.0001971589,0.0002797429,0.00004767566,0.00005918207,0.00005198059,0.0002830778,0.0000670289,0.0006581925],"category_scores_gemma":[0.00002323484,0.0001239687,0.0001208472,0.0001341722,0.00003392347,0.00006999751,0.00001702346,0.0001569076,0.002514134],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001728999,"about_ca_system_score_gemma":0.00000734759,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003465386,"about_ca_topic_score_gemma":0.000001417509,"domain_scores_codex":[0.9989812,0.00008494721,0.0003344138,0.0001581384,0.000204968,0.0002362691],"domain_scores_gemma":[0.9989852,0.0003125396,0.0000544172,0.0005710724,0.00002282601,0.0000539997],"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.00001406355,0.00003564874,0.00006102692,0.0002911009,0.0001019238,0.000004527368,0.001103731,0.0004452469,0.006013629,0.9846958,0.007102175,0.000131143],"study_design_scores_gemma":[0.002231675,0.0002091537,0.00008252116,0.0008278882,0.00006011309,0.00006528985,0.001170339,0.03202017,0.01253436,0.9209821,0.0287474,0.001069054],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7642911,0.000121946,0.0004142603,0.0002636831,0.0002503754,0.0008140889,0.000005388865,0.0003250829,0.233514],"genre_scores_gemma":[0.9963936,0.000004238608,0.0001947765,0.0001664868,0.00001876434,0.0001047726,0.000003737083,0.0000457736,0.0030679],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2321024,"threshold_uncertainty_score":0.9982625,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000493122,0.0001530612,0.0002510106,0.00004046438,0.00004494813,0.00001582914,0.0001828205,0.00007657457,0.00006664055],"category_scores_gemma":[0.00001579152,0.0001038893,0.00008123791,0.00008774135,0.00008138322,0.00010048,0.00003984906,0.00009692883,0.0000331378],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008856501,"about_ca_system_score_gemma":0.00000532788,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008228216,"about_ca_topic_score_gemma":0.000002401744,"domain_scores_codex":[0.9991429,0.00006889333,0.0003027662,0.00009055353,0.0001773434,0.000217553],"domain_scores_gemma":[0.9993572,0.0000761375,0.00008287664,0.0003932265,0.00001515023,0.00007543964],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001247493,0.001235876,0.08211936,0.01105289,0.001287695,0.00001924866,0.07108109,0.0001886252,0.3021928,0.5170176,0.009228288,0.004451773],"study_design_scores_gemma":[0.006338439,0.0002309429,0.01186887,0.002579527,0.000584681,0.0005909546,0.01443916,0.004702087,0.5686013,0.3187602,0.06846683,0.002837022],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.958928,0.001689335,0.0003467038,0.00005092456,0.0002525749,0.0003494723,0.00001344281,0.0000832177,0.03828627],"genre_scores_gemma":[0.999304,0.00000621649,0.0001535969,0.00004347785,0.00001986279,0.00001784713,4.915467e-7,0.00003414305,0.0004203612],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2664085,"threshold_uncertainty_score":0.4236481,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001354345,0.0002053549,0.0005573164,0.0001110651,0.0003451672,0.00001983021,0.0006202177,0.00005056286,0.00418663],"category_scores_gemma":[0.00130206,0.0001483026,0.0002189747,0.0005865556,0.0002843398,0.00008358883,0.0004158839,0.0003152985,0.00005311688],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002352379,"about_ca_system_score_gemma":0.0000619741,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006263114,"about_ca_topic_score_gemma":0.000004186862,"domain_scores_codex":[0.997649,0.0003905774,0.0007752171,0.0003021533,0.0005518768,0.0003311622],"domain_scores_gemma":[0.9948745,0.003661729,0.0005474892,0.0007740739,0.00007724359,0.00006501399],"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.000100711,0.0006879486,0.004358834,0.0003689557,0.000365581,0.00004959524,0.01831169,0.000005266652,0.0007603088,0.9421622,0.03159915,0.001229756],"study_design_scores_gemma":[0.0008619964,0.00008780845,0.0002489643,0.00002074605,0.00006839617,0.000187027,0.01442449,0.0001543943,0.00111625,0.9766306,0.005973127,0.0002262205],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9182941,0.0001657971,0.003025559,0.004037989,0.0002125167,0.0008355852,0.00005019949,0.0001325043,0.07324578],"genre_scores_gemma":[0.9925553,0.000004516074,0.003891769,0.0002687906,0.00002930711,0.000141057,0.000007952239,0.00004008831,0.003061249],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0742612,"threshold_uncertainty_score":0.9967237,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003962194,0.0001273735,0.0002430818,0.00007558039,0.0002922717,0.0001788535,0.001168302,0.00004188505,0.00007916289],"category_scores_gemma":[0.0002297283,0.0001086865,0.0001345038,0.00006596792,0.0001692127,0.0002995374,0.0001063189,0.00008069092,0.00008551332],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008309857,"about_ca_system_score_gemma":0.00003598546,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009896826,"about_ca_topic_score_gemma":0.000004071253,"domain_scores_codex":[0.9990938,0.00005048935,0.0002828001,0.0002201148,0.0002022861,0.0001505642],"domain_scores_gemma":[0.9977293,0.0003346704,0.0003498471,0.001440602,0.00007423347,0.00007134057],"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.00001301772,0.000111726,0.00005700075,0.00002794533,0.00003444077,0.000005833556,0.0005462608,0.000003099726,0.002053297,0.99498,0.0009803521,0.001187063],"study_design_scores_gemma":[0.0009025088,0.0002775142,0.0005162162,0.00024913,0.0000195246,0.000007950192,0.00008265986,0.002810555,0.0112484,0.9821005,0.001535248,0.0002497185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.2643205,0.00005714183,0.3294641,0.003513044,0.0006400431,0.0008007872,0.00002327729,0.0002720666,0.400909],"genre_scores_gemma":[0.9970845,0.00000301251,0.002456118,0.0001319307,0.000008297037,0.00001890339,0.000001148223,0.000007106939,0.0002889844],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7327639,"threshold_uncertainty_score":0.4432105,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001353386,0.0002597459,0.000473325,0.0001627805,0.0003929689,0.00003679253,0.0007164355,0.0001165639,0.0001738002],"category_scores_gemma":[0.0008501949,0.0001597617,0.0002390611,0.0007151032,0.0002487639,0.0001412201,0.0002470412,0.0001841103,0.00008154404],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002226057,"about_ca_system_score_gemma":0.00004381747,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008404737,"about_ca_topic_score_gemma":0.00001834288,"domain_scores_codex":[0.9979185,0.0002130663,0.000676741,0.0003249237,0.0004934266,0.0003732712],"domain_scores_gemma":[0.9971018,0.0006823387,0.0002702581,0.001617798,0.0001661108,0.0001616896],"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.00002987903,0.0001083627,0.0001714907,0.0002200074,0.0000612547,0.000008352443,0.008766935,0.00002006521,0.002574077,0.9799181,0.007703969,0.0004174616],"study_design_scores_gemma":[0.0003273223,0.00009457193,0.0007128583,0.0002437928,0.00006444958,0.0000201471,0.002127544,0.0007927243,0.002848292,0.9915796,0.0009668282,0.0002218915],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9833965,0.00001586813,0.001007797,0.001277307,0.0003371981,0.0009706124,0.0001042411,0.0003092407,0.01258121],"genre_scores_gemma":[0.9958838,0.000006783037,0.002853841,0.0003024284,0.00004225424,0.00005602476,0.00001224874,0.00005846119,0.0007841694],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01248727,"threshold_uncertainty_score":0.6514891,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004603647,0.0006135462,0.001001709,0.0001313167,0.00007260472,0.0001441135,0.0003955358,0.0005632704,0.00005870052],"category_scores_gemma":[0.0002276238,0.000551153,0.0002287574,0.0001216075,0.000120581,0.00006541375,0.0001846168,0.001016614,0.0001021683],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000365288,"about_ca_system_score_gemma":0.00005906537,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001067479,"about_ca_topic_score_gemma":0.000003101462,"domain_scores_codex":[0.9975111,0.0001255704,0.0009738796,0.0006457889,0.0003937252,0.000349926],"domain_scores_gemma":[0.998305,0.0003493793,0.0001944566,0.0007412645,0.00004055085,0.0003693547],"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.0006892052,0.00009346497,0.00004618647,0.005343523,0.002343996,0.0006314039,0.008421636,0.01153874,0.005436664,0.9457452,0.01735141,0.002358573],"study_design_scores_gemma":[0.002234839,0.0001848392,0.0004290807,0.001792424,0.0002434466,0.0001491125,0.0003779561,0.02618777,0.001979023,0.9635572,0.001596837,0.001267487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8674053,0.002783547,0.006196357,0.002069471,0.002714196,0.002548307,0.0006956086,0.002306591,0.1132806],"genre_scores_gemma":[0.9966947,0.00005662198,0.002416931,0.00004808569,0.0001204886,0.00003224469,0.0001733592,0.0001079238,0.0003496791],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1292893,"threshold_uncertainty_score":0.999694,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008331224,0.0002175605,0.0003333608,0.0004968604,0.0002581085,0.0002136193,0.001123371,0.00005791646,0.00002156464],"category_scores_gemma":[0.0001627317,0.0001931872,0.0001692227,0.0013327,0.0000610002,0.0003466524,0.0002621878,0.000149764,0.0001448398],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001589257,"about_ca_system_score_gemma":0.0000389601,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004864769,"about_ca_topic_score_gemma":0.000001217558,"domain_scores_codex":[0.9984205,0.00009791027,0.0004042489,0.0004619117,0.0002403642,0.0003750313],"domain_scores_gemma":[0.9985453,0.000324938,0.00009121754,0.000813256,0.00007870926,0.0001466007],"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.000005375154,0.00006653377,0.0001116532,0.00005817612,0.0000469998,0.00002948155,0.001124669,0.00001309621,0.002291046,0.9854182,0.0007439667,0.01009081],"study_design_scores_gemma":[0.0004576817,0.00006615929,0.000175949,0.0003911749,0.00001790574,0.00002455384,0.0002898265,0.00431076,0.003728438,0.9862096,0.003979936,0.0003479568],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03266646,0.0002484554,0.9181078,0.002179101,0.0004912546,0.0003887991,0.000001853718,0.0004362712,0.04548003],"genre_scores_gemma":[0.9333299,0.000006395264,0.06388022,0.001136268,0.00001336633,0.00005990693,0.000001038493,0.00001223898,0.001560624],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9006635,"threshold_uncertainty_score":0.7877944,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00250144,0.0001289459,0.0001763407,0.00006776382,0.001114905,0.0002201097,0.001019816,0.00002470704,0.00001544217],"category_scores_gemma":[0.00008166877,0.00008953614,0.0001214398,0.0003310376,0.00005155914,0.0001308605,0.000231103,0.0001626249,0.00001242643],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007957935,"about_ca_system_score_gemma":0.00009570436,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005114916,"about_ca_topic_score_gemma":0.000005872574,"domain_scores_codex":[0.9985493,0.000214115,0.0002407217,0.0002723646,0.0004016299,0.0003218745],"domain_scores_gemma":[0.997619,0.001498913,0.0001738786,0.0005525716,0.0001036472,0.00005199479],"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.00008109974,0.0001066044,0.0007997538,0.00004399583,0.0001320243,0.000004244571,0.002467679,0.00002414029,0.0003914019,0.9907237,0.001090222,0.004135107],"study_design_scores_gemma":[0.003315623,0.001648816,0.0003701076,0.00009979093,0.0000991605,0.00007345778,0.003081596,0.04944299,0.008915555,0.7953644,0.1365814,0.001007148],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4140587,0.0005019465,0.5616679,0.009060301,0.0004684999,0.002266282,0.000025818,0.0005747531,0.01137579],"genre_scores_gemma":[0.9824943,0.000007645781,0.0152706,0.0002372853,0.00002477645,0.0005346339,0.000003916053,0.00001979809,0.001407043],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5684356,"threshold_uncertainty_score":0.8575063,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00136112,0.0003206054,0.0007407707,0.0002100144,0.0001744049,0.00005007785,0.0004518889,0.0001851935,0.0004442364],"category_scores_gemma":[0.001105602,0.0002636149,0.0001866594,0.0009171103,0.0003405988,0.0001493091,0.0000892023,0.00032079,0.00006532816],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005995462,"about_ca_system_score_gemma":0.0001195891,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006069668,"about_ca_topic_score_gemma":0.0002578719,"domain_scores_codex":[0.9975752,0.000337622,0.0009596903,0.000456844,0.000228215,0.0004424252],"domain_scores_gemma":[0.9962335,0.00232949,0.0002696614,0.0009056844,0.0001368817,0.0001248023],"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.0001336673,0.0006986429,0.001896568,0.0005013804,0.00008902708,0.00001891416,0.0006853758,2.663791e-7,0.001454719,0.9919256,0.00233394,0.0002619026],"study_design_scores_gemma":[0.001590412,0.00003038785,0.0008588044,0.00024956,0.00006739341,0.00001015562,0.0004163423,0.0003678005,0.003785889,0.9911557,0.001188299,0.0002792847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9493621,0.00007255269,0.01239577,0.002416917,0.0001754686,0.002153788,0.0000588579,0.0004459614,0.0329186],"genre_scores_gemma":[0.9950032,0.0000104382,0.002900077,0.0004692154,0.000007096504,0.0002447602,0.00001576364,0.00002547698,0.001324009],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04564108,"threshold_uncertainty_score":0.9999816,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004288392,0.0001465017,0.0001612911,0.0001061516,0.00003312431,0.0001617206,0.0001765712,0.00005744037,0.0002192586],"category_scores_gemma":[0.00003345146,0.0001015365,0.00004982725,0.0002509589,0.00002583172,0.0000996318,0.000008218949,0.0002119454,0.0005362001],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002219539,"about_ca_system_score_gemma":0.00001165111,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005995648,"about_ca_topic_score_gemma":0.000005036985,"domain_scores_codex":[0.9992073,0.00003078068,0.0002481005,0.0001395094,0.0001795282,0.0001948084],"domain_scores_gemma":[0.9993443,0.0003686391,0.00001508051,0.0002311313,0.000009389631,0.0000313923],"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.00004057487,0.0002329574,0.00009216354,0.002473718,0.0001969092,0.0006331694,0.03250049,0.2065052,0.0006091193,0.6211959,0.132752,0.002767911],"study_design_scores_gemma":[0.0008468531,0.0001494826,0.00004167921,0.001673647,0.0000378413,0.0001604301,0.0007936127,0.8825929,0.0008532226,0.04479487,0.06737263,0.0006828607],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.222529,0.002383462,0.03263534,0.003677427,0.001252077,0.001642432,0.00004632707,0.002401686,0.7334323],"genre_scores_gemma":[0.9980388,0.00003641455,0.0009244923,0.0001954258,0.00002119869,0.00004366633,0.00001398488,0.00003727273,0.0006887392],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7755098,"threshold_uncertainty_score":0.6891946,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003199333,0.0002039212,0.000476685,0.0001856752,0.00009732904,0.00001458475,0.0003570256,0.00006593407,0.00001973384],"category_scores_gemma":[0.0001195441,0.0001509659,0.0002065839,0.0007614037,0.0001828857,0.00006905465,0.00004101733,0.000119547,0.000004173594],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002143086,"about_ca_system_score_gemma":0.00003214822,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007267646,"about_ca_topic_score_gemma":0.00007060388,"domain_scores_codex":[0.9986883,0.0001543756,0.0006327502,0.0001773549,0.0001688264,0.000178364],"domain_scores_gemma":[0.9987772,0.0002574305,0.0001400481,0.000672157,0.0001127757,0.00004041016],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001117389,0.0008050253,0.0102337,0.007739223,0.001612981,0.000008802223,0.01363253,0.0006601437,0.5080976,0.4507324,0.003789976,0.002575833],"study_design_scores_gemma":[0.001971505,0.00009288144,0.02259097,0.004432095,0.0005040241,0.00002813711,0.001816155,0.01301997,0.5042406,0.4488575,0.001571281,0.0008748774],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9712133,0.0008991087,0.0005531381,0.0002039565,0.0003145527,0.0007909285,0.00003251633,0.0005011316,0.02549139],"genre_scores_gemma":[0.9986562,0.00001166732,0.0008703305,0.00001154861,0.000005803321,0.00006923094,0.000007321212,0.00002530794,0.0003425691],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02744294,"threshold_uncertainty_score":0.6156211,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005197919,0.0002358449,0.0002834352,0.0001748115,0.00007042683,0.001581555,0.001171952,0.00007194516,0.00004958055],"category_scores_gemma":[0.0001064378,0.0001985124,0.0001412009,0.0004881867,0.0001017419,0.001561168,0.0003400361,0.0001690538,0.001153253],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000364666,"about_ca_system_score_gemma":0.00008155776,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006008725,"about_ca_topic_score_gemma":6.675761e-7,"domain_scores_codex":[0.9982711,0.00002952722,0.0004116008,0.0005525604,0.0004198483,0.0003153457],"domain_scores_gemma":[0.9986668,0.0002271184,0.00007649805,0.0008419157,0.00007459958,0.0001130577],"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.000005885045,0.0001895412,0.000008496099,0.0009718635,0.00007904269,0.0003730921,0.003493962,8.280993e-8,0.006003446,0.8236175,0.06308737,0.1021697],"study_design_scores_gemma":[0.0002140838,0.0001274937,0.000005722024,0.001110471,0.00002140405,0.0002135771,0.00004193204,0.05480632,0.03421396,0.8355795,0.07306948,0.0005960753],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001084761,0.0007038836,0.8918915,0.006590766,0.0002083209,0.0003170583,0.00001089253,0.003306,0.0958868],"genre_scores_gemma":[0.8074873,0.0000107307,0.1877953,0.001544255,0.00002816887,0.00007130299,0.000002360362,0.00003831332,0.00302223],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8064026,"threshold_uncertainty_score":0.9996245,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001145478,0.0001235555,0.0002714064,0.00002446277,0.00004181699,0.00002677576,0.0001795214,0.0000526652,0.0002459511],"category_scores_gemma":[0.0001123978,0.0001106657,0.00006115474,0.0001966776,0.00007935765,0.0000977649,0.00001299476,0.00009259985,0.0001037628],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005284568,"about_ca_system_score_gemma":0.00002114406,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004227992,"about_ca_topic_score_gemma":0.000001451271,"domain_scores_codex":[0.9992469,0.00003391477,0.0003538364,0.000105586,0.000142485,0.0001172819],"domain_scores_gemma":[0.9994743,0.0001038193,0.00006732082,0.0002061909,0.0000625137,0.00008586849],"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.00008795119,0.00005685394,0.0006490675,0.003034858,0.0004316984,0.00004392821,0.02544966,0.004966512,0.2227678,0.7325423,0.009228428,0.000740898],"study_design_scores_gemma":[0.003514108,0.0009473737,0.001668373,0.001252055,0.0003743793,0.0001812696,0.008659877,0.3496863,0.1859274,0.4143288,0.03091656,0.002543441],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9589076,0.0005648471,0.006075386,0.0003207311,0.0002459933,0.0004385308,0.00002688911,0.0003717909,0.0330482],"genre_scores_gemma":[0.9990698,0.000005842665,0.0007618097,0.00007306294,0.00002076966,0.000007825099,0.000005567233,0.00002152319,0.00003383286],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3447198,"threshold_uncertainty_score":0.4512815,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001683156,0.0001391836,0.0002780025,0.0001952451,0.0002022713,0.0001531626,0.0005612813,0.00007886026,0.00003019256],"category_scores_gemma":[0.0009124245,0.0001263051,0.00006601763,0.0008791139,0.0004602997,0.0006470664,0.0003509978,0.0001745502,0.0001434845],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001098151,"about_ca_system_score_gemma":0.0000595604,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003872529,"about_ca_topic_score_gemma":0.000002439292,"domain_scores_codex":[0.9981847,0.000132387,0.0003665541,0.0003574298,0.0005804989,0.0003783776],"domain_scores_gemma":[0.9978702,0.001152034,0.00009973028,0.0005494347,0.0002085141,0.0001200563],"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.00001067997,0.00006925519,0.001020416,0.0001814297,0.00001267028,0.00003545693,0.001733728,5.154665e-7,0.002053431,0.9929446,0.000132777,0.001805022],"study_design_scores_gemma":[0.0005456451,0.00004017234,0.0007531697,0.0001184065,0.000004905205,0.00005632898,0.0002487911,0.01275733,0.00301137,0.9821457,0.0001570664,0.0001611234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5712349,0.0001313248,0.4179968,0.002083607,0.0001821584,0.0005620731,0.00002105759,0.0004654438,0.007322561],"genre_scores_gemma":[0.9800839,0.00001210294,0.01948895,0.00004700556,0.000005193127,0.00002825209,0.000002163157,0.00001419199,0.0003182061],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.408849,"threshold_uncertainty_score":0.5150573,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006301207,0.000163704,0.0001960399,0.00007761089,0.00009706654,0.00004821057,0.0002580668,0.0000549683,0.000108785],"category_scores_gemma":[0.00004078819,0.0001057325,0.00009426485,0.0003247735,0.0000501096,0.00005241203,0.00001944553,0.000122661,0.002837328],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001073568,"about_ca_system_score_gemma":0.000006273311,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001056121,"about_ca_topic_score_gemma":0.000001112216,"domain_scores_codex":[0.9990953,0.00005921705,0.0002739667,0.0001314817,0.000190114,0.0002499828],"domain_scores_gemma":[0.9989232,0.0005457309,0.00003550825,0.0004243124,0.00001726446,0.00005400787],"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.000008923814,0.00002900782,0.0000165407,0.0003283877,0.00009560309,0.00002553997,0.002803251,0.000364154,0.004781115,0.9318729,0.05950267,0.0001718891],"study_design_scores_gemma":[0.0007036168,0.0001332804,0.0000539956,0.0006126201,0.00004046326,0.00003976294,0.002426866,0.02362536,0.008233329,0.9355518,0.02792404,0.0006548323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5880986,0.00008412192,0.0005996555,0.00207217,0.0005251914,0.001042895,0.00001713853,0.002100747,0.4054595],"genre_scores_gemma":[0.9972828,0.000006836377,0.00004976457,0.0001018147,0.00002485039,0.0001733109,0.000004844208,0.00004413278,0.002311655],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4091842,"threshold_uncertainty_score":0.9979391,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002219304,0.0002012256,0.0002767421,0.0000160833,0.0001549758,0.0000857573,0.0003821168,0.0001267958,0.003585195],"category_scores_gemma":[0.0000860056,0.0001363679,0.0002709317,0.0001307855,0.0001724344,0.00006964078,0.00005109681,0.0001529771,0.0001835335],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002417868,"about_ca_system_score_gemma":0.00009310948,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000750833,"about_ca_topic_score_gemma":0.000001740775,"domain_scores_codex":[0.9988351,0.000007530743,0.0004594008,0.0002901454,0.0001905484,0.0002172422],"domain_scores_gemma":[0.998094,0.001009949,0.0001096858,0.0006428552,0.00008518507,0.00005836114],"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.0001091692,0.000555846,0.000309697,0.01089656,0.001268305,0.00001209032,0.002582771,0.00001203643,0.3884345,0.5044132,0.08721352,0.004192318],"study_design_scores_gemma":[0.0006932127,0.00001575634,0.00000888218,0.0007384592,0.0002860404,0.00009602228,0.0009815727,0.003690814,0.4157896,0.1303785,0.4468839,0.0004372093],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6102561,0.006712446,0.006927467,0.01189032,0.0003943887,0.001035011,0.0005439596,0.0007153074,0.3615249],"genre_scores_gemma":[0.9810303,0.00006774616,0.0009564092,0.00004597444,0.0001331557,0.0004084022,0.0000537392,0.0000452858,0.01725897],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3740348,"threshold_uncertainty_score":0.9973257,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009467267,0.000695814,0.00175317,0.0001990473,0.0001483923,0.0001411545,0.0004700214,0.0004599584,0.00006558466],"category_scores_gemma":[0.001097329,0.0006086636,0.0001841696,0.0003356168,0.0002987678,0.0002246056,0.0007659861,0.0005937174,0.000002884519],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001163073,"about_ca_system_score_gemma":0.0004081131,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003651734,"about_ca_topic_score_gemma":0.00006652807,"domain_scores_codex":[0.9963491,0.0002722259,0.001462206,0.0007427427,0.0006738048,0.0004999495],"domain_scores_gemma":[0.995047,0.0008747776,0.0016343,0.001543995,0.0007200468,0.0001798496],"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.00005421108,0.0008712986,0.0001015699,0.0184954,0.000644183,0.00004961486,0.006814599,0.0003530863,0.005793388,0.9662794,0.0004225955,0.0001206801],"study_design_scores_gemma":[0.001355715,0.0001393345,0.000006989334,0.004887316,0.000384335,0.00007522498,0.0007820588,0.00575714,0.00364056,0.9822029,0.00006039219,0.000708022],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3012135,0.001312228,0.6814404,0.000605919,0.0005409216,0.005389919,0.0001650242,0.0005816083,0.008750433],"genre_scores_gemma":[0.7479511,0.000211978,0.25019,0.00003671291,0.00005434003,0.000544005,0.0001033668,0.0002047016,0.0007037545],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4467377,"threshold_uncertainty_score":0.9996365,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}