{"meta":{"query_hash":"1d3d63e81b96","filters":{"venue":"Ars Mathematica Contemporanea"},"cohort_total":25,"direct_labels_cover":0,"predictions_cover":25,"exported":25,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/1d3d63e81b96","api":"https://metacan.xera.ac/api/v1/cohort?venue=Ars+Mathematica+Contemporanea"},"results":[{"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.04058789558511034,"score_gpt":0.28508342551818544,"score_spread":0.2444955299330751,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1531172582","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9399068,0.0003559989,0.025154058,0.00014555003,0.000036474612,0.000015050469,0.00013220457,0.00012623412,0.03412763],"genre_scores_gemma":[0.9925033,0.00016364046,0.0033104517,0.000017357805,0.000034657773,0.00001167389,0.00013740514,0.000026950886,0.0037946089],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996815,0.00003844284,0.000017333,0.00006656468,0.00009400867,0.000102220976],"domain_scores_gemma":[0.9997116,0.00008248708,0.000058968966,0.00004067014,0.000037464517,0.00006886529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017699423,0.0002866564,0.00031619234,0.0008425901,0.000909604,0.0012521823,0.00028396022,0.0002474562,0.0024309568],"category_scores_gemma":[0.00078888587,0.00020313064,0.00035364705,0.00030030668,0.0009883704,0.001148034,0.001606746,0.00047485292,0.00029377476],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013980284,0.0000243912,0.0029302498,0.00007893816,0.000021810692,0.00064926967,0.0009461487,0.0044001997,0.0145271495,0.9610362,0.00090022234,0.014345618],"study_design_scores_gemma":[0.000048918042,0.00021571139,0.012280199,0.00007189828,0.00011919352,0.0029950722,0.002340907,0.046687722,0.035463583,0.86157334,0.0381322,0.00007133843],"about_ca_topic_score_codex":0.0008633306,"about_ca_topic_score_gemma":0.0006615023,"teacher_disagreement_score":0.0024309568,"about_ca_system_score_codex":0.0005372052,"about_ca_system_score_gemma":0.00019393908,"threshold_uncertainty_score":0},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.18957620399634692,"score_gpt":0.35977249129040595,"score_spread":0.17019628729405903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1864023698","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8740061,0.0008945682,0.08403102,0.00043751294,0.0001898324,0.00005537889,0.00016372255,0.00021126098,0.040010694],"genre_scores_gemma":[0.9710345,0.00074423925,0.015147756,0.00014519402,0.00021212414,0.000045262186,0.00029223177,0.000104209175,0.012274298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995179,0.00012957041,0.00002413402,0.0000993902,0.000108923974,0.0001200197],"domain_scores_gemma":[0.99774915,0.0009925204,0.0004617391,0.0003109522,0.00020058305,0.00028509035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054297183,0.00048698828,0.00034945575,0.001437893,0.0010236192,0.0013463084,0.0005222713,0.00063536415,0.0026714404],"category_scores_gemma":[0.0029522635,0.00028390097,0.0007970215,0.00090213073,0.0023694264,0.0017262035,0.00090929633,0.0009664268,0.00043580023],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000095925316,0.000073630465,0.0019226734,0.00007945377,0.00002161965,0.00032465233,0.0010880446,0.010163966,0.01297395,0.95823485,0.0011409315,0.01388031],"study_design_scores_gemma":[0.000032645967,0.000074678064,0.0011701891,0.000024756946,0.000019218827,0.00018268256,0.00026304982,0.019223172,0.0036777942,0.9688534,0.0064578545,0.000020434818],"about_ca_topic_score_codex":0.0022978352,"about_ca_topic_score_gemma":0.0026687067,"teacher_disagreement_score":0.0026714404,"about_ca_system_score_codex":0.0010168668,"about_ca_system_score_gemma":0.00048906094,"threshold_uncertainty_score":0.008936882},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Mathematics; Gray code; Vertex (graph theory); Graph; Discrete mathematics; Algorithm","score_opus":0.06167349681544703,"score_gpt":0.25360880754050263,"score_spread":0.1919353107250556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1930124199","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27614433,0.007361852,0.3613296,0.0048672636,0.0012096504,0.00015434489,0.0016510924,0.0011074607,0.34617448],"genre_scores_gemma":[0.8459671,0.0030877988,0.11249046,0.0010705973,0.0006155347,0.00027959072,0.00087017735,0.00029192443,0.0353268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955684,0.00009867175,0.000019188557,0.00009516239,0.00013362554,0.00009659887],"domain_scores_gemma":[0.9985393,0.00080485054,0.00013986311,0.00016372393,0.0001822681,0.00017003421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043171505,0.00058964925,0.00046289913,0.0027624366,0.0010202087,0.0021394682,0.00060688757,0.00092415354,0.00825364],"category_scores_gemma":[0.003578826,0.00024705732,0.0004057886,0.0021426792,0.002212303,0.002364948,0.001364705,0.001972349,0.0014031583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017189182,0.0000068945005,0.00018172986,0.000031083437,0.0000026621208,0.00003612284,0.00009954044,0.0016780879,0.000687806,0.9845718,0.0029152925,0.009771789],"study_design_scores_gemma":[0.0000073567694,0.000008195549,0.00021235924,0.000022872939,0.0000033068955,0.000067465204,0.000044224467,0.006198334,0.0004923758,0.98072135,0.01221192,0.000010245277],"about_ca_topic_score_codex":0.0016734137,"about_ca_topic_score_gemma":0.0015481124,"teacher_disagreement_score":0.00825364,"about_ca_system_score_codex":0.0019518564,"about_ca_system_score_gemma":0.00055322115,"threshold_uncertainty_score":0.027611136},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05551745062615196,"score_gpt":0.2872404894410327,"score_spread":0.23172303881488074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1935837271","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8960927,0.00037289932,0.045550168,0.00043307684,0.000110974455,0.00005592378,0.00023164072,0.00023117397,0.056921385],"genre_scores_gemma":[0.98801374,0.00022176902,0.0055158027,0.00013359373,0.000041811752,0.000032696706,0.00016955883,0.000030585114,0.0058405465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998454,0.00003373462,0.0000066586676,0.000038017108,0.000033070086,0.00004311647],"domain_scores_gemma":[0.99932003,0.0002547325,0.00015684981,0.000076626864,0.00007834153,0.000113345166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013730893,0.00028608716,0.0002548273,0.0007418134,0.0009150983,0.0010033705,0.00043074923,0.0003846615,0.006089005],"category_scores_gemma":[0.00081378646,0.0002080822,0.00027559712,0.00063975394,0.0010198108,0.0011722215,0.00068332715,0.00045669187,0.00043086236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006608038,0.000038424183,0.002176238,0.00010392909,0.000031859843,0.0006868701,0.0007936171,0.0031493318,0.008659565,0.9676151,0.0021141176,0.014564752],"study_design_scores_gemma":[0.00003670882,0.000045599027,0.001403605,0.000020715595,0.000033457658,0.00043649608,0.00052932056,0.014545118,0.004996787,0.970338,0.0075960886,0.000018005696],"about_ca_topic_score_codex":0.0012930151,"about_ca_topic_score_gemma":0.0023743268,"teacher_disagreement_score":0.006089005,"about_ca_system_score_codex":0.00046746663,"about_ca_system_score_gemma":0.00031866023,"threshold_uncertainty_score":0.020369768},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.031894086918758995,"score_gpt":0.26342375152607067,"score_spread":0.23152966460731167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149893488","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4327442,0.00015131262,0.55314964,0.0018207246,0.00008972657,0.00028546934,0.000847203,0.002058672,0.00885306],"genre_scores_gemma":[0.85336816,0.00011023724,0.14171077,0.00035189968,0.00007867542,0.00020049684,0.0014663425,0.00023156058,0.0024818634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99546105,0.00090917153,0.0005096507,0.001658456,0.000849293,0.0006123508],"domain_scores_gemma":[0.970063,0.022611769,0.0015296784,0.0034236843,0.0018342832,0.00053756963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024746424,0.00042079776,0.0007921378,0.00067012024,0.0017182808,0.0028580856,0.0015285471,0.0017164013,0.0034871208],"category_scores_gemma":[0.022170398,0.00080670486,0.001567479,0.0007625017,0.002964404,0.0043419697,0.0018716877,0.0020766992,0.00054343545],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014374168,0.00040496184,0.01110614,0.000585092,0.0001538439,0.0008410506,0.0013707067,0.09693086,0.046945855,0.7281016,0.007595125,0.10452737],"study_design_scores_gemma":[0.00013487718,0.00012577788,0.0009916665,0.0000266766,0.000060576705,0.00031149865,0.00025823963,0.21881548,0.033046827,0.742559,0.0036179337,0.000051412895],"about_ca_topic_score_codex":0.0019066074,"about_ca_topic_score_gemma":0.0020999159,"teacher_disagreement_score":0.0034871208,"about_ca_system_score_codex":0.0019405439,"about_ca_system_score_gemma":0.002184697,"threshold_uncertainty_score":0.01407975},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.013342769437347258,"score_gpt":0.1992963778698754,"score_spread":0.18595360843252814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160085175","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68792915,0.0013236306,0.155137,0.0005999048,0.00007798752,0.000117290605,0.0030916755,0.0004405175,0.15128274],"genre_scores_gemma":[0.9028574,0.00095831015,0.07495006,0.00013356033,0.00008172418,0.00018114521,0.002695718,0.00017110947,0.017970948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999519,0.000059671016,0.00002183661,0.000067055254,0.0002271158,0.00010535318],"domain_scores_gemma":[0.9982792,0.00083639094,0.00020183338,0.00021924984,0.0002551924,0.00020820589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034301783,0.0003610484,0.00041343272,0.0017240914,0.0008850785,0.0013427084,0.0006318098,0.00037360183,0.006008187],"category_scores_gemma":[0.002576755,0.0003202494,0.0006562875,0.0015110126,0.0010214881,0.0009866562,0.00072481856,0.001134095,0.0007487808],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003132757,0.00016451167,0.0029213864,0.00031055746,0.00004857774,0.00032340887,0.00033890014,0.077334404,0.013787944,0.84329253,0.008292458,0.05287206],"study_design_scores_gemma":[0.000054684475,0.00011291556,0.0037823778,0.00005623877,0.000028523018,0.0005266546,0.00026411412,0.120297976,0.0141380215,0.83947915,0.021192834,0.00006648595],"about_ca_topic_score_codex":0.0016637177,"about_ca_topic_score_gemma":0.0018319348,"teacher_disagreement_score":0.006008187,"about_ca_system_score_codex":0.00077018054,"about_ca_system_score_gemma":0.00063109334,"threshold_uncertainty_score":0.020099342},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04310956707898594,"score_gpt":0.3163105992394612,"score_spread":0.27320103216047525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605443665","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60838646,0.0016166104,0.2768697,0.0009872449,0.00016435489,0.00021954157,0.0036515386,0.0006016566,0.1075029],"genre_scores_gemma":[0.9382078,0.0009200111,0.036801897,0.0003978386,0.0001118546,0.0001801588,0.0048254393,0.00011593064,0.018439157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989423,0.00014174439,0.000063468106,0.00038463043,0.00023583691,0.00023211462],"domain_scores_gemma":[0.99810505,0.0004412011,0.00033061788,0.0004683025,0.00027117616,0.00038357062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033253737,0.00056231313,0.00058479287,0.0012836539,0.0015995039,0.0016680261,0.001445607,0.00074690185,0.008441491],"category_scores_gemma":[0.0022948661,0.0004144599,0.00041600186,0.0015540725,0.0018154564,0.003111001,0.0027896836,0.0014853291,0.0014064427],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040722787,0.000058041063,0.005096265,0.0002084249,0.000056724715,0.0008149183,0.00080630154,0.013145357,0.013207232,0.9198889,0.0056755454,0.04063509],"study_design_scores_gemma":[0.00005658113,0.000095097035,0.0036421844,0.00006442225,0.000059355352,0.0013907566,0.00092663226,0.02298074,0.0070363525,0.90436757,0.05934298,0.000037431488],"about_ca_topic_score_codex":0.0011595429,"about_ca_topic_score_gemma":0.0010642755,"teacher_disagreement_score":0.008441491,"about_ca_system_score_codex":0.0009451075,"about_ca_system_score_gemma":0.00047599498,"threshold_uncertainty_score":0.028239548},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Mathematics; Fold (higher-order function); Combinatorics; Computer science","score_opus":0.032275262402703966,"score_gpt":0.2719553988205454,"score_spread":0.23968013641784147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783366629","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87932867,0.00026298506,0.07512246,0.00026399852,0.00011459007,0.000050585575,0.00019936149,0.00020000954,0.044457402],"genre_scores_gemma":[0.9835263,0.00015112717,0.008266327,0.000068361944,0.0000680202,0.00006944867,0.00019551434,0.00006947703,0.0075853947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994943,0.000072664625,0.000023972305,0.00011018431,0.00011509955,0.00018376007],"domain_scores_gemma":[0.999283,0.00014871644,0.0001307456,0.000090867456,0.00009697229,0.00024965242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039108878,0.00041495168,0.00033495488,0.0018674113,0.0015417353,0.0020287673,0.00045030745,0.00078720076,0.005871108],"category_scores_gemma":[0.0014987714,0.0003317274,0.00048135297,0.00094864616,0.0018069234,0.0026573478,0.0021304341,0.001027895,0.00073150167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036102225,0.000016122094,0.0008222268,0.000020575018,0.0000068921754,0.00035029923,0.00033994607,0.0019664601,0.004545534,0.9865628,0.00038062356,0.0049524433],"study_design_scores_gemma":[0.000034758254,0.000092340524,0.002096094,0.000048451104,0.000015637306,0.00082500203,0.00059629936,0.025682518,0.0061069173,0.9574502,0.0070142066,0.00003766419],"about_ca_topic_score_codex":0.0006149371,"about_ca_topic_score_gemma":0.0005203045,"teacher_disagreement_score":0.005871108,"about_ca_system_score_codex":0.00088109175,"about_ca_system_score_gemma":0.0002935225,"threshold_uncertainty_score":0.019640863},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.023343701156026606,"score_gpt":0.27035868547273595,"score_spread":0.24701498431670935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2887847305","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8805264,0.00029655168,0.07525057,0.00041471104,0.00018309471,0.00003510182,0.00010950554,0.00017147207,0.043012664],"genre_scores_gemma":[0.97631866,0.00014291119,0.010844663,0.000077059805,0.00009952718,0.0000277577,0.00010096096,0.00005932218,0.0123291705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953234,0.00006121035,0.000023841209,0.00014587167,0.00012187185,0.00011491123],"domain_scores_gemma":[0.998912,0.00026553668,0.00018615807,0.00011320578,0.00016188553,0.0003612949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049487676,0.00039768787,0.0003624904,0.0014570014,0.0012668618,0.0018604154,0.00039401947,0.0005583961,0.00268803],"category_scores_gemma":[0.0019214181,0.00035802426,0.00062518247,0.00036081648,0.0022901283,0.0021011222,0.0016393953,0.0011840785,0.00041303135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016917865,0.0000454026,0.0017342728,0.000048537746,0.000018385783,0.0003579806,0.00060722756,0.0022396292,0.008210894,0.9791068,0.00044021785,0.007021602],"study_design_scores_gemma":[0.000040292427,0.00010405016,0.001577283,0.000025195224,0.00003072999,0.00080096186,0.00046160904,0.015255605,0.010371545,0.96229583,0.008993854,0.000043140895],"about_ca_topic_score_codex":0.00034500164,"about_ca_topic_score_gemma":0.0002970344,"teacher_disagreement_score":0.00268803,"about_ca_system_score_codex":0.00081082643,"about_ca_system_score_gemma":0.00038802117,"threshold_uncertainty_score":0.008992314},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.012920302364196869,"score_gpt":0.1901795957811386,"score_spread":0.17725929341694174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949183821","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.462333,0.0012021391,0.38119364,0.008791239,0.00031260107,0.00038224034,0.0019214517,0.0008619014,0.14300175],"genre_scores_gemma":[0.8551502,0.0011313998,0.10026214,0.0012004981,0.0004945725,0.00039651513,0.002414027,0.00020779324,0.038742796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990439,0.0002593404,0.00003825942,0.00021560726,0.00015373706,0.00028911707],"domain_scores_gemma":[0.9980945,0.0012020794,0.00016146715,0.00022334354,0.00015374908,0.0001648394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009019257,0.0006935645,0.0006415772,0.0007140502,0.0013995717,0.0012869408,0.0009949727,0.0014089717,0.013303781],"category_scores_gemma":[0.0048859897,0.00033717888,0.0007155157,0.0010015812,0.0015966569,0.003632687,0.0019307524,0.0019245698,0.0010876909],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023142088,0.00011921072,0.001062225,0.00024361536,0.000044475455,0.00037347357,0.00033034603,0.046462663,0.0019599001,0.86606914,0.030067317,0.053036224],"study_design_scores_gemma":[0.00009495316,0.0000662775,0.00051259866,0.00004114357,0.000017323056,0.00025227875,0.0002701592,0.11642194,0.0012959604,0.8681228,0.012870463,0.000034108307],"about_ca_topic_score_codex":0.0049261088,"about_ca_topic_score_gemma":0.005531559,"teacher_disagreement_score":0.013303781,"about_ca_system_score_codex":0.0011116676,"about_ca_system_score_gemma":0.0012803016,"threshold_uncertainty_score":0.044505596},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.05881974860328973,"score_gpt":0.28752604053060493,"score_spread":0.2287062919273152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2972549413","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71711147,0.00080139627,0.25231838,0.001156322,0.000104948434,0.000083846164,0.00038371157,0.00009981393,0.027940115],"genre_scores_gemma":[0.9527452,0.00029542978,0.03982326,0.00015027843,0.000069194066,0.00007754084,0.00016660994,0.000018072744,0.006654421],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995204,0.00008627799,0.00003049327,0.00019830005,0.00009509306,0.00006942358],"domain_scores_gemma":[0.9988451,0.0005326845,0.000195999,0.00017721918,0.00012252852,0.00012640437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007320927,0.00024470853,0.00052722887,0.00060856645,0.0011978956,0.0010099717,0.00077737897,0.0008345235,0.0042976653],"category_scores_gemma":[0.0035771176,0.00022480142,0.00059266476,0.00071690435,0.0014166685,0.0032732903,0.001109382,0.00093013444,0.00019160059],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003422756,0.000022605052,0.0015932834,0.000046794867,0.000013728674,0.00020734317,0.00031809372,0.0064157564,0.0031319426,0.97665536,0.0007326493,0.010828227],"study_design_scores_gemma":[0.000025487794,0.00006865435,0.0018144031,0.000025253536,0.000020025604,0.0006497277,0.00034513575,0.058914594,0.0026490162,0.92887396,0.0065894476,0.000024219522],"about_ca_topic_score_codex":0.00082404265,"about_ca_topic_score_gemma":0.0010758948,"teacher_disagreement_score":0.0042976653,"about_ca_system_score_codex":0.0011415944,"about_ca_system_score_gemma":0.00044067076,"threshold_uncertainty_score":0.014377177},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Discrete mathematics; Graph","score_opus":0.02250036835189753,"score_gpt":0.266323145948113,"score_spread":0.24382277759621548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995405989","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7678424,0.0005129321,0.18644871,0.00033290437,0.0003217162,0.0001597527,0.0005106157,0.001399063,0.04247186],"genre_scores_gemma":[0.86938137,0.00032195542,0.11657444,0.00022767199,0.00007383501,0.0001107482,0.0005219328,0.00027917497,0.01250882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995492,0.00008810732,0.000021091055,0.000094386814,0.000094032366,0.00015313699],"domain_scores_gemma":[0.99856514,0.0005109598,0.00018054899,0.0003683248,0.00014610095,0.00022900559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026264216,0.00029084773,0.0003348262,0.00077767606,0.00086572114,0.0011508074,0.0006445333,0.0005512691,0.003824393],"category_scores_gemma":[0.0020783907,0.00032654844,0.00040514584,0.0007214487,0.00096466194,0.001456208,0.001311426,0.00070708455,0.0008538646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060883857,0.0002866783,0.006741517,0.00030228338,0.00007605044,0.0014169617,0.0019790644,0.10647926,0.11818103,0.59429014,0.009576996,0.16006121],"study_design_scores_gemma":[0.00013146168,0.00033063555,0.004480388,0.00008659092,0.00004932334,0.00094722665,0.0005736789,0.22662237,0.031375736,0.67240256,0.06290713,0.000092863855],"about_ca_topic_score_codex":0.0018171828,"about_ca_topic_score_gemma":0.0034908094,"teacher_disagreement_score":0.003824393,"about_ca_system_score_codex":0.0008237895,"about_ca_system_score_gemma":0.0004665636,"threshold_uncertainty_score":0.012793839},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.020613894835832557,"score_gpt":0.22285676506902058,"score_spread":0.20224287023318802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3039500359","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36113158,0.0061927703,0.47887376,0.0022071032,0.00056691584,0.0001093437,0.00043084368,0.00031970447,0.15016797],"genre_scores_gemma":[0.87849313,0.0030762192,0.099962145,0.0005138599,0.0006240814,0.00013489038,0.00036642398,0.00010640354,0.016722813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896204,0.00016893765,0.0000750237,0.00022907913,0.00042988773,0.00013506573],"domain_scores_gemma":[0.99578685,0.0025002318,0.00050097494,0.00045377022,0.00056001655,0.00019811817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012901175,0.0006616079,0.0005754673,0.0022851632,0.0013206167,0.0018670654,0.000983298,0.0011030681,0.0045901453],"category_scores_gemma":[0.006138834,0.00044328754,0.0007139028,0.0011304305,0.0028587938,0.0054107686,0.0018582286,0.0022109277,0.0006672442],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003486861,0.000032762495,0.001043038,0.00019616802,0.000012544383,0.00032064703,0.0002814526,0.0035632188,0.0050163562,0.97058207,0.0012535413,0.017663319],"study_design_scores_gemma":[0.00001540313,0.00007851219,0.00081501366,0.00007051183,0.000021597647,0.001234616,0.00028221897,0.018063297,0.0066123693,0.96083486,0.011937955,0.000033672004],"about_ca_topic_score_codex":0.00024972108,"about_ca_topic_score_gemma":0.00030054615,"teacher_disagreement_score":0.0045901453,"about_ca_system_score_codex":0.0007407816,"about_ca_system_score_gemma":0.00041597034,"threshold_uncertainty_score":0.015355587},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.024498562677013024,"score_gpt":0.22336806235402998,"score_spread":0.19886949967701695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3043264869","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9051589,0.00008246296,0.04819236,0.00035529188,0.0000945265,0.000026093889,0.00024041445,0.00022338674,0.045626648],"genre_scores_gemma":[0.9853661,0.000045616485,0.007816195,0.000067205285,0.000037475962,0.000025956462,0.00018195559,0.00004219873,0.0064172605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996562,0.00006225507,0.000016295297,0.00008733452,0.000056228237,0.00012165552],"domain_scores_gemma":[0.99887246,0.00033657716,0.00027196892,0.00016937967,0.00010763122,0.00024200101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026449698,0.00024099255,0.00028774867,0.0010615684,0.0014708472,0.0019983866,0.0005831398,0.00088477455,0.007674302],"category_scores_gemma":[0.001539509,0.00035483867,0.0003856088,0.00067034573,0.0016109516,0.0017253984,0.0014260414,0.0013605154,0.0008259746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021204917,0.00006586787,0.0039456193,0.00004088144,0.000014717697,0.0008696412,0.00054460234,0.0067656133,0.008355241,0.96372265,0.0024535512,0.013009609],"study_design_scores_gemma":[0.00006224655,0.000083591825,0.0036371166,0.000028389066,0.000017384202,0.00097488816,0.0008940939,0.03674417,0.007420312,0.9441678,0.0059260596,0.000043782304],"about_ca_topic_score_codex":0.0010592308,"about_ca_topic_score_gemma":0.0013911341,"teacher_disagreement_score":0.007674302,"about_ca_system_score_codex":0.00084332586,"about_ca_system_score_gemma":0.00030113498,"threshold_uncertainty_score":0.025673091},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.024295702719765194,"score_gpt":0.23637362297935255,"score_spread":0.21207792025958735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3206898017","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81486815,0.0003886417,0.16303217,0.0005855211,0.00003554711,0.000091480644,0.00015552154,0.00020922165,0.020633765],"genre_scores_gemma":[0.92115855,0.00015823747,0.07566663,0.00004387898,0.00002740853,0.000089215595,0.00017379699,0.00006222939,0.0026199985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992768,0.0001848207,0.000052924002,0.00014941409,0.00022295227,0.00011304341],"domain_scores_gemma":[0.99641824,0.001877665,0.0006485928,0.0006109764,0.00018869224,0.00025585754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011135474,0.0004828226,0.00072887336,0.0011757559,0.0013740296,0.0021096326,0.0007683599,0.00092275144,0.008213092],"category_scores_gemma":[0.006512233,0.0006074379,0.0006019842,0.0006505446,0.0020280096,0.0035682959,0.0018391598,0.0015017814,0.0008786592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017813873,0.00007782149,0.0025486927,0.00018475542,0.00003129446,0.00027562262,0.00043369774,0.018161999,0.014177707,0.942785,0.00078863016,0.020356664],"study_design_scores_gemma":[0.00009697676,0.00020926676,0.00096946716,0.00008368183,0.00004524787,0.0005363588,0.0007689865,0.055644933,0.016092906,0.91531986,0.010167179,0.00006510191],"about_ca_topic_score_codex":0.00013174769,"about_ca_topic_score_gemma":0.0003173045,"teacher_disagreement_score":0.008213092,"about_ca_system_score_codex":0.00053843216,"about_ca_system_score_gemma":0.0006414399,"threshold_uncertainty_score":0.027475595},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.06273831897571314,"score_gpt":0.3450033576025214,"score_spread":0.28226503862680824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4288050662","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89490646,0.0006703929,0.08148637,0.00030114746,0.0000772637,0.00010738424,0.0006817906,0.0011193746,0.02064989],"genre_scores_gemma":[0.89180577,0.00040625242,0.09570935,0.00008637982,0.000031114945,0.0002052504,0.00134763,0.00075729087,0.009650897],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993844,0.000092289374,0.000054289372,0.00015421184,0.0001292854,0.00018546781],"domain_scores_gemma":[0.99767286,0.001063932,0.00032275368,0.0003811086,0.00030250903,0.00025680807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061232614,0.0007396103,0.0011921745,0.0015514577,0.0010497876,0.0016459055,0.00096037076,0.0008122764,0.007775347],"category_scores_gemma":[0.0045669638,0.0005004487,0.0004996262,0.0011650898,0.00064703583,0.0015974941,0.0006291068,0.00056825596,0.0014414603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010115658,0.00059664284,0.022935007,0.0011665358,0.00021127594,0.0009942208,0.0008952307,0.326323,0.14295602,0.22083345,0.020554,0.26152307],"study_design_scores_gemma":[0.00014816021,0.0007640579,0.008342924,0.00012664731,0.00020890473,0.0018203175,0.0008651142,0.67033094,0.080739945,0.22174172,0.014781396,0.00012985671],"about_ca_topic_score_codex":0.00044484125,"about_ca_topic_score_gemma":0.0013705787,"teacher_disagreement_score":0.007775347,"about_ca_system_score_codex":0.0005865484,"about_ca_system_score_gemma":0.0009060256,"threshold_uncertainty_score":0.02601111},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.07039809403969605,"score_gpt":0.3332737596129833,"score_spread":0.26287566557328723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313589773","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16721408,0.0041072797,0.7290615,0.0024349615,0.00045206863,0.00019066327,0.0008090483,0.00038357565,0.095346846],"genre_scores_gemma":[0.8540718,0.0036454087,0.12599292,0.0009986437,0.0008237794,0.00036018697,0.0005239517,0.00018643274,0.013396909],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972773,0.00067718414,0.00015447279,0.00069084344,0.0008036777,0.0003966151],"domain_scores_gemma":[0.9938803,0.0032399525,0.0006187628,0.0010792572,0.0007749069,0.00040683843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033426369,0.00064532534,0.001377871,0.0026489873,0.0023112756,0.0027670274,0.001680909,0.0010138955,0.0038031861],"category_scores_gemma":[0.010807268,0.0005927227,0.0016416078,0.002549046,0.004383812,0.0080833435,0.0047490452,0.0032223677,0.0007163099],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039807583,0.000014148018,0.0004050044,0.00006888046,0.0000140778275,0.00011535625,0.00021680907,0.004499656,0.0008843882,0.9849186,0.0012635976,0.0075598317],"study_design_scores_gemma":[0.000027513206,0.000056562505,0.00069299544,0.00006021007,0.000027063748,0.0004861582,0.00015102506,0.029768897,0.001429139,0.95029765,0.01697114,0.000031772503],"about_ca_topic_score_codex":0.0013819311,"about_ca_topic_score_gemma":0.0009761429,"teacher_disagreement_score":0.0038031861,"about_ca_system_score_codex":0.0022058224,"about_ca_system_score_gemma":0.00089361676,"threshold_uncertainty_score":0.017677784},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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)","score_opus":0.03054575374732277,"score_gpt":0.3541777078688711,"score_spread":0.3236319541215483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4317617507","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.867873,0.0025699355,0.07092644,0.0010685234,0.00007910291,0.000041425836,0.00089271786,0.00029281646,0.056256037],"genre_scores_gemma":[0.9893545,0.0009154195,0.0061854552,0.00010534425,0.00011480257,0.000044171782,0.00043855445,0.00005578881,0.0027860892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954885,0.000088804074,0.000012960983,0.00012156405,0.000118508186,0.00010920922],"domain_scores_gemma":[0.9919559,0.0058375075,0.00060754333,0.000317926,0.00036475674,0.000916278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007120123,0.00064925686,0.00043673886,0.0029358338,0.00095934194,0.0013625842,0.00090109464,0.000475725,0.003398327],"category_scores_gemma":[0.007173557,0.00039648748,0.0003968963,0.0011865365,0.0018633584,0.0015905767,0.0011338665,0.0016236842,0.0003064516],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00084104,0.00017900253,0.026970029,0.0005828659,0.00017846577,0.0011280362,0.0013597427,0.065374136,0.041207556,0.7996013,0.013572281,0.049005456],"study_design_scores_gemma":[0.000055738077,0.00007456915,0.019102322,0.000108673514,0.00010011395,0.0012669291,0.0002679048,0.16212316,0.010309186,0.79730034,0.009212348,0.00007866703],"about_ca_topic_score_codex":0.0010926818,"about_ca_topic_score_gemma":0.0016952867,"teacher_disagreement_score":0.003398327,"about_ca_system_score_codex":0.0010289145,"about_ca_system_score_gemma":0.00037201174,"threshold_uncertainty_score":0.011368573},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.018478833660245924,"score_gpt":0.20446352596479575,"score_spread":0.18598469230454984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385585618","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15725212,0.002793403,0.66896296,0.010678233,0.0011288231,0.00068803877,0.0028921692,0.0020078449,0.1535965],"genre_scores_gemma":[0.57599926,0.0037654797,0.3158226,0.004782511,0.0023158914,0.0012483018,0.010841794,0.0016116487,0.083612606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99667346,0.0009862737,0.00016724854,0.0009563146,0.00060543517,0.0006111813],"domain_scores_gemma":[0.99546105,0.0021852467,0.00034155993,0.00097290985,0.0004979816,0.00054129673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021607608,0.0020718253,0.0018497338,0.0011688359,0.0027799362,0.0032315445,0.0031816214,0.0026285008,0.028437823],"category_scores_gemma":[0.010106421,0.0010267905,0.001958762,0.0020855544,0.0026518914,0.01151548,0.0044364077,0.005369988,0.0044721295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042775815,0.00023704991,0.0010282613,0.00041418066,0.000072212824,0.0002769814,0.00038545768,0.024394877,0.0016297913,0.82281977,0.060346182,0.08796742],"study_design_scores_gemma":[0.00009237899,0.00007448907,0.00028366593,0.00006294944,0.000023686656,0.00024433204,0.00020296195,0.04724497,0.0009431058,0.924355,0.026436199,0.000036383517],"about_ca_topic_score_codex":0.0023183753,"about_ca_topic_score_gemma":0.0022657004,"teacher_disagreement_score":0.028437823,"about_ca_system_score_codex":0.0019482186,"about_ca_system_score_gemma":0.002251241,"threshold_uncertainty_score":0.09513402},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Mathematics; Combinatorics; Group (periodic table); Chemistry","score_opus":0.0324005936871241,"score_gpt":0.283248272130124,"score_spread":0.2508476784429999,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394880856","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44637063,0.0013610662,0.06911269,0.00631903,0.0014522976,0.00015392387,0.0013613037,0.0011741021,0.47269484],"genre_scores_gemma":[0.892448,0.00068492355,0.023103885,0.0009326484,0.00024030366,0.000119443335,0.0013931359,0.00018794191,0.08088958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995121,0.000047929396,0.000027345075,0.00015473716,0.00011446626,0.00014352221],"domain_scores_gemma":[0.99950063,0.00012412416,0.00010170175,0.00007279798,0.00011141867,0.00008924841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003221317,0.00040090733,0.00066726486,0.0006359257,0.0014900649,0.0019771822,0.00051220274,0.0006440507,0.016039575],"category_scores_gemma":[0.00076974614,0.00023225928,0.0005489581,0.00061577547,0.0022823133,0.0022107288,0.0012201564,0.0015520946,0.0020393333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019064477,0.00003225112,0.0006849014,0.000079789774,0.000024737034,0.00033251735,0.00025931324,0.00039476212,0.004025782,0.96848226,0.0053310804,0.020162083],"study_design_scores_gemma":[0.00010808374,0.00008937397,0.0016284268,0.000032006275,0.00003805148,0.0006610238,0.0005144713,0.0022027446,0.007545541,0.7912933,0.19584225,0.000044732118],"about_ca_topic_score_codex":0.0020627817,"about_ca_topic_score_gemma":0.0017550396,"teacher_disagreement_score":0.016039575,"about_ca_system_score_codex":0.0013733166,"about_ca_system_score_gemma":0.00079836237,"threshold_uncertainty_score":0.05365777},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.017820622021383604,"score_gpt":0.23765007792806922,"score_spread":0.21982945590668562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400497258","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65979654,0.0025570474,0.3097714,0.00037819427,0.0000736207,0.00010055322,0.00045850078,0.00034521028,0.026518954],"genre_scores_gemma":[0.95207316,0.0016852288,0.04325757,0.00009139734,0.00007550344,0.00010844763,0.0004068821,0.00009843055,0.0022033653],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985378,0.00027417275,0.00009565349,0.00020141085,0.0004935454,0.00039737095],"domain_scores_gemma":[0.9955721,0.0022970943,0.00078476075,0.00049393426,0.00040678817,0.00044527976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015326199,0.0010016713,0.0012992888,0.0021227703,0.0012201233,0.0025955737,0.0012524984,0.0006412355,0.0033022857],"category_scores_gemma":[0.0107649295,0.00095826574,0.000558046,0.0020712554,0.0023413172,0.003917342,0.002375418,0.00115929,0.00059600803],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000968174,0.000215603,0.0035429434,0.00033619095,0.000058456335,0.0003161995,0.0007625696,0.21433498,0.01326159,0.70466644,0.0040719495,0.05746481],"study_design_scores_gemma":[0.0000653086,0.00022563552,0.0024624928,0.0000954345,0.00002445096,0.00025209648,0.00054079056,0.60429406,0.008296385,0.3792673,0.004416351,0.00005959087],"about_ca_topic_score_codex":0.0028976488,"about_ca_topic_score_gemma":0.0013736273,"teacher_disagreement_score":0.0033022857,"about_ca_system_score_codex":0.0022633031,"about_ca_system_score_gemma":0.0005909894,"threshold_uncertainty_score":0.016421497},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.02638621480805793,"score_gpt":0.2921125223561837,"score_spread":0.26572630754812576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405650678","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2795978,0.031692468,0.32535934,0.009698302,0.0012798974,0.00021982059,0.0036105504,0.0020036683,0.3465382],"genre_scores_gemma":[0.9074306,0.011558538,0.05665204,0.0014635201,0.0013551973,0.0003660247,0.0019333959,0.0005417528,0.01869895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951585,0.00054341083,0.00016828351,0.00097591954,0.0016702187,0.0014836026],"domain_scores_gemma":[0.98158664,0.012728077,0.0012682107,0.0017972256,0.0011481125,0.0014717508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031638022,0.0027924639,0.0018531503,0.005464232,0.0035509751,0.006530272,0.004047893,0.0026110278,0.014614119],"category_scores_gemma":[0.024500262,0.0017949509,0.0014258621,0.004193127,0.0051182923,0.014463198,0.0067997505,0.0074856663,0.003388809],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000699533,0.0002996148,0.0034166414,0.00087268837,0.00010802116,0.00054839486,0.0006343136,0.028432192,0.009460638,0.8737016,0.018750804,0.06307564],"study_design_scores_gemma":[0.0000458866,0.00014571415,0.002147948,0.00034816872,0.00010651305,0.0006934117,0.00018021012,0.049584504,0.00932768,0.90813476,0.029152796,0.00013235374],"about_ca_topic_score_codex":0.0020153297,"about_ca_topic_score_gemma":0.0030097093,"teacher_disagreement_score":0.014614119,"about_ca_system_score_codex":0.0042112023,"about_ca_system_score_gemma":0.0010997055,"threshold_uncertainty_score":0.04888904},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.007890167093602561,"score_gpt":0.22104538520205289,"score_spread":0.2131552181084503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408720272","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55703443,0.0008101626,0.3883006,0.0005896276,0.00011552701,0.00018690503,0.0006874223,0.0002464997,0.052028734],"genre_scores_gemma":[0.887931,0.00071941095,0.09583514,0.00021027857,0.00013693243,0.00014372446,0.0010389942,0.00015459934,0.01383001],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993881,0.00011794402,0.00004155823,0.00020100415,0.00014208148,0.0001092379],"domain_scores_gemma":[0.99774736,0.00090263895,0.0004551111,0.0003834207,0.00022178165,0.00028972438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058843655,0.0004965239,0.00036815013,0.0012802472,0.0007646588,0.0012563433,0.0008745952,0.0005119814,0.007538706],"category_scores_gemma":[0.0027706495,0.00050866825,0.0007984324,0.0009810088,0.0014811122,0.0029482027,0.0011383449,0.0014685036,0.0005871111],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000987498,0.00005239383,0.0011044076,0.00018392465,0.000038883096,0.0006548795,0.0007516405,0.0122784525,0.005723657,0.9531337,0.0018916146,0.024087725],"study_design_scores_gemma":[0.000031183594,0.000058595277,0.0006781706,0.000032926986,0.000030011312,0.000580546,0.0002958422,0.03820392,0.00414728,0.94718784,0.008735285,0.000018363084],"about_ca_topic_score_codex":0.00058842055,"about_ca_topic_score_gemma":0.00076768984,"teacher_disagreement_score":0.007538706,"about_ca_system_score_codex":0.0004904514,"about_ca_system_score_gemma":0.0002582875,"threshold_uncertainty_score":0.0252195},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Mathematics; Convexity; Centrality; Combinatorics; Discrete mathematics; Business","score_opus":0.05923040225344551,"score_gpt":0.34313408951968566,"score_spread":0.28390368726624016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412409721","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28666773,0.0014781614,0.65253896,0.0027582184,0.00009046576,0.00008320564,0.0004013006,0.0003854206,0.05559661],"genre_scores_gemma":[0.9429814,0.0011007496,0.048840556,0.0003549199,0.00026561518,0.00010561523,0.00024996395,0.00015308241,0.0059480714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990651,0.00032588007,0.000024116276,0.00026474288,0.00022487623,0.000095387455],"domain_scores_gemma":[0.9949504,0.0033868686,0.0005890645,0.00038554796,0.0004444864,0.00024349599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001052519,0.00047571055,0.00076515775,0.0016098928,0.0010781916,0.0020697755,0.0008508608,0.00066851656,0.002701243],"category_scores_gemma":[0.007151546,0.00038522464,0.00056442234,0.0017631869,0.003786837,0.0032364554,0.001265496,0.0016848946,0.00039363204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003305706,0.000014680681,0.0011435626,0.000061324696,0.000019666251,0.00014023435,0.00033629627,0.014955278,0.001730844,0.9683506,0.0018417774,0.011372738],"study_design_scores_gemma":[0.000011267159,0.0000224374,0.0014258788,0.00001890875,0.000016959491,0.00025142802,0.00014218682,0.09773288,0.0011174367,0.89364344,0.0055995323,0.00001757568],"about_ca_topic_score_codex":0.0023203038,"about_ca_topic_score_gemma":0.0021099648,"teacher_disagreement_score":0.002701243,"about_ca_system_score_codex":0.0016253121,"about_ca_system_score_gemma":0.00063356606,"threshold_uncertainty_score":0.011792541},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.012585412892742544,"score_gpt":0.25702225554295166,"score_spread":0.24443684265020912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414100071","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09001614,0.00065431197,0.86910313,0.0012534893,0.000115718874,0.00013299513,0.00020040093,0.00048692364,0.038036887],"genre_scores_gemma":[0.7844237,0.0010580457,0.19226341,0.0006862615,0.0002334531,0.00030709314,0.00022219197,0.00035063212,0.020455254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998747,0.00047691798,0.00004396852,0.0003409662,0.00024938173,0.00014171288],"domain_scores_gemma":[0.9958455,0.002346991,0.00035672114,0.0009015458,0.00022143638,0.00032779932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014592272,0.0006458853,0.00061504764,0.0009396376,0.001138636,0.0020218194,0.0017178433,0.0012214145,0.006365962],"category_scores_gemma":[0.006651936,0.00049028615,0.0011060322,0.0010968877,0.0035908206,0.0059921728,0.0031652716,0.0034200442,0.00075386564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030763007,0.000033376633,0.00027594162,0.00004961904,0.000013417887,0.00007589964,0.00023108965,0.037915822,0.0015003523,0.94884986,0.0008086995,0.010215143],"study_design_scores_gemma":[0.000014123436,0.000017954026,0.00008736864,0.000014302735,0.000008388121,0.00004753074,0.000048404636,0.11354298,0.000710043,0.8811178,0.0043798103,0.000011234784],"about_ca_topic_score_codex":0.0020775937,"about_ca_topic_score_gemma":0.001912766,"teacher_disagreement_score":0.006365962,"about_ca_system_score_codex":0.0016763343,"about_ca_system_score_gemma":0.00079702534,"threshold_uncertainty_score":0.021296263},"labels":[],"label_agreement":null}]}