{"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8323634,0.00013575546,0.027832981,0.0009802328,0.00034157684,0.00064764835,0.000040623898,0.00020599674,0.13745174],"genre_scores_gemma":[0.9807283,0.000004543353,0.01669927,0.00012559217,0.00005389584,0.000019500296,0.000006861731,0.00004080231,0.0023212258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979563,0.00014338997,0.0007997351,0.00030360968,0.0004063343,0.00039064934],"domain_scores_gemma":[0.9967814,0.001882437,0.0004638575,0.00060727895,0.00012565097,0.00013935777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010642541,0.00025869109,0.00077459053,0.00019883711,0.00006666967,0.000017601258,0.00039962173,0.00015766794,0.0005926885],"category_scores_gemma":[0.002273223,0.00022216226,0.00021230265,0.00028751927,0.0002654617,0.00011015521,0.000110346795,0.00015352515,0.00018262211],"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.00005360814,0.00033055953,0.00047912603,0.00047109643,0.00013370969,0.00001078574,0.0013555981,7.7193823e-7,0.0021721325,0.98285633,0.011241427,0.00089483766],"study_design_scores_gemma":[0.001971707,0.00043994986,0.00014242102,0.00013393472,0.00011830455,0.00005651486,0.0009995495,0.00029218523,0.0051235016,0.98251814,0.0078038364,0.00039997607],"about_ca_topic_score_codex":0.000020960571,"about_ca_topic_score_gemma":0.0000054579505,"teacher_disagreement_score":0.14836486,"about_ca_system_score_codex":0.000026375183,"about_ca_system_score_gemma":0.00005217368,"threshold_uncertainty_score":0.9059514},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8637185,0.00009582875,0.0018342464,0.0008845513,0.0001968793,0.0013088704,0.000045318324,0.00033902278,0.13157676],"genre_scores_gemma":[0.98405296,0.0000032544397,0.01305199,0.00010102021,0.000019970425,0.00008840107,0.000008595657,0.00009756742,0.0025762473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965122,0.000417949,0.0009388412,0.00041153625,0.0011863068,0.0005331893],"domain_scores_gemma":[0.9937652,0.0036006474,0.00044557295,0.0013760738,0.00045847043,0.00035407513],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0035747353,0.00034596023,0.00085405295,0.00034549276,0.000086146356,0.000050390474,0.0009127773,0.00017810856,0.00045582835],"category_scores_gemma":[0.006210775,0.00029469145,0.00021851859,0.0005045666,0.0003307427,0.00018641572,0.00025819827,0.0003606364,0.00037224503],"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.00021974773,0.0005846569,0.00017469545,0.00055652973,0.0001323411,0.00006785054,0.0035797728,0.000005852571,0.0015465615,0.96693593,0.026057562,0.00013849974],"study_design_scores_gemma":[0.0016321331,0.0004937934,0.000017663582,0.00037933412,0.000042903863,0.000029810975,0.00088442274,0.0013743377,0.004200539,0.9903084,0.00036806456,0.00026857908],"about_ca_topic_score_codex":0.00004172212,"about_ca_topic_score_gemma":0.00001785859,"teacher_disagreement_score":0.12900051,"about_ca_system_score_codex":0.00008672856,"about_ca_system_score_gemma":0.00018224398,"threshold_uncertainty_score":0.9999505},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.072757706,0.00039517746,0.8319501,0.002199378,0.0012108904,0.0020647326,0.000027562708,0.0016675723,0.08772683],"genre_scores_gemma":[0.8024287,0.0000055270043,0.1964199,0.00044483703,0.000002420175,0.000102389706,0.0000029583748,0.000020728803,0.00057252974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985141,0.000043583437,0.00044096063,0.00041636362,0.00023248617,0.000352494],"domain_scores_gemma":[0.99851334,0.00019104584,0.00018223401,0.00080387405,0.00014995236,0.00015954355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068623974,0.00020127722,0.0003039095,0.00012508541,0.00015282625,0.00007176751,0.00077104714,0.00007480984,0.000031504605],"category_scores_gemma":[0.00009675308,0.00016546999,0.00018614116,0.00028106073,0.00010430534,0.000289905,0.000089848094,0.000084712345,0.00014241696],"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.000010320712,0.00013992519,0.00013948104,0.00007212693,0.000040265004,0.00000762718,0.0026556903,5.3103656e-7,0.00062796916,0.99111956,0.0045710145,0.0006154693],"study_design_scores_gemma":[0.0007114709,0.00011456936,0.000025374455,0.000067086185,0.000017135257,0.000022218646,0.00008673798,0.0032189228,0.0033926764,0.99082214,0.0012720418,0.00024962082],"about_ca_topic_score_codex":0.000035444285,"about_ca_topic_score_gemma":0.00001105392,"teacher_disagreement_score":0.729671,"about_ca_system_score_codex":0.000008255348,"about_ca_system_score_gemma":0.00004161703,"threshold_uncertainty_score":0.674767},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9619633,0.00006833245,0.0009200922,0.0017928133,0.00010657592,0.0028310104,0.000039734066,0.00054871297,0.031729404],"genre_scores_gemma":[0.9895041,0.000010020341,0.006086391,0.00053573813,0.00004626836,0.0006959424,0.000022046102,0.00023856365,0.0028609072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953283,0.0005117705,0.0010168635,0.0007669196,0.0013074429,0.0010686788],"domain_scores_gemma":[0.9939334,0.0024811632,0.0005833796,0.0021233065,0.0003619839,0.0005168016],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013707407,0.0007368454,0.0011534289,0.00035625428,0.00045575592,0.00044691048,0.0010529984,0.0002423837,0.0009014538],"category_scores_gemma":[0.00075251854,0.0005437364,0.00028943544,0.00060595316,0.00056355866,0.00041497612,0.00019661551,0.00078480446,0.0021517822],"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.0006221848,0.0035111653,0.0045941556,0.0023333537,0.0009087969,0.00056038727,0.0086226845,0.0000053223516,0.0033525003,0.9417958,0.032483403,0.0012102041],"study_design_scores_gemma":[0.0030786584,0.0009300612,0.0017370364,0.0012016621,0.00008955812,0.00019078505,0.0044237957,0.00052842626,0.0014633337,0.98466617,0.0006060348,0.0010844847],"about_ca_topic_score_codex":0.00016618853,"about_ca_topic_score_gemma":0.0001238738,"teacher_disagreement_score":0.04287032,"about_ca_system_score_codex":0.00014806815,"about_ca_system_score_gemma":0.00007362916,"threshold_uncertainty_score":0.99970144},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037698008,0.00031829436,0.93329316,0.010328002,0.00045261774,0.0019393216,0.0000072874814,0.0007082267,0.015255102],"genre_scores_gemma":[0.97539014,0.0000050207136,0.022551242,0.0013930986,0.00003467964,0.00008040215,0.0000017446027,0.00001325436,0.00053041417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986337,0.00006741668,0.0003846991,0.00033491186,0.00022966988,0.00034962583],"domain_scores_gemma":[0.998171,0.00066372653,0.00016016854,0.00085517095,0.000068525645,0.00008145726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009005176,0.00019377051,0.00027271628,0.000058346875,0.0002919057,0.00025871187,0.0011937501,0.00005104787,0.0000070122096],"category_scores_gemma":[0.00024454272,0.00009816316,0.00016075296,0.00018800268,0.0000730393,0.00030259433,0.000075798496,0.00008935814,0.00004042886],"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.000014581752,0.00011826532,0.000009563149,0.000063248444,0.00002397135,0.00001530854,0.0018821938,0.0000020138446,0.0028936893,0.9449989,0.0027921288,0.047186114],"study_design_scores_gemma":[0.000496422,0.0002169604,0.00007568919,0.00013124074,0.000020386795,0.00007725044,0.00013938204,0.0758396,0.0026275183,0.91613364,0.0039722184,0.00026967432],"about_ca_topic_score_codex":0.0000030361105,"about_ca_topic_score_gemma":0.0000011187637,"teacher_disagreement_score":0.9376921,"about_ca_system_score_codex":0.000016432832,"about_ca_system_score_gemma":0.000046326764,"threshold_uncertainty_score":0.40029776},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95892805,0.0016893345,0.00034670383,0.000050924562,0.00025257486,0.00034947228,0.000013442808,0.0000832177,0.038286272],"genre_scores_gemma":[0.999304,0.0000062164895,0.00015359688,0.000043477852,0.000019862788,0.000017847127,4.915467e-7,0.000034143046,0.00042036123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991429,0.00006889333,0.0003027662,0.000090553534,0.00017734342,0.00021755304],"domain_scores_gemma":[0.99935716,0.000076137505,0.000082876635,0.00039322648,0.000015150231,0.00007543964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049312203,0.00015306119,0.00025101058,0.000040464383,0.00004494813,0.000015829135,0.00018282051,0.00007657457,0.00006664055],"category_scores_gemma":[0.00001579152,0.00010388925,0.000081237915,0.00008774135,0.00008138322,0.00010048002,0.000039849056,0.00009692883,0.000033137803],"study_design_candidate":"bench_or_experimental","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.00012474932,0.0012358765,0.08211936,0.011052888,0.0012876955,0.000019248655,0.071081094,0.00018862517,0.30219278,0.5170176,0.009228288,0.004451773],"study_design_scores_gemma":[0.006338439,0.00023094285,0.011868868,0.0025795265,0.000584681,0.0005909546,0.014439165,0.004702087,0.56860125,0.31876025,0.06846683,0.0028370218],"about_ca_topic_score_codex":0.000008228216,"about_ca_topic_score_gemma":0.0000024017443,"teacher_disagreement_score":0.26640847,"about_ca_system_score_codex":0.000008856501,"about_ca_system_score_gemma":0.00000532788,"threshold_uncertainty_score":0.42364806},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21309325,0.00029104415,0.4447365,0.010999343,0.0007660992,0.0018858351,0.000026609347,0.0014765632,0.32672474],"genre_scores_gemma":[0.9817305,0.000014175348,0.015511261,0.000103062055,0.000010921169,0.00004036125,0.0000022464149,0.000022405398,0.002565033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981582,0.00009201376,0.0003472612,0.00041828703,0.00049396046,0.0004902397],"domain_scores_gemma":[0.9965479,0.00027604093,0.0003440138,0.0024762803,0.00015869635,0.0001970807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009976705,0.0002087736,0.00033931274,0.00013164757,0.0008345318,0.0005853691,0.0032363737,0.00007653018,0.00003705902],"category_scores_gemma":[0.0006990471,0.0001761763,0.00015159808,0.00018509287,0.00032278994,0.0012751945,0.00057630945,0.00021375778,0.00035343983],"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.000009494806,0.000082900915,0.00071099063,0.000037084472,0.00004407799,0.000059308633,0.0005952814,6.4592723e-7,0.0007435612,0.99357665,0.0004969565,0.0036430596],"study_design_scores_gemma":[0.00064381026,0.00006257448,0.0012772641,0.00007498489,0.0000058514665,0.000018850338,0.000065003995,0.0031630618,0.0014490503,0.99178797,0.0011833123,0.0002682729],"about_ca_topic_score_codex":0.000016504195,"about_ca_topic_score_gemma":0.000012336286,"teacher_disagreement_score":0.7686373,"about_ca_system_score_codex":0.000028387032,"about_ca_system_score_gemma":0.000068152236,"threshold_uncertainty_score":0.7184261},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26432052,0.00005714183,0.3294641,0.0035130437,0.00064004306,0.0008007872,0.00002327729,0.00027206657,0.400909],"genre_scores_gemma":[0.9970845,0.0000030125098,0.0024561181,0.0001319307,0.000008297037,0.00001890339,0.0000011482232,0.0000071069394,0.00028898445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990938,0.00005048935,0.00028280012,0.00022011476,0.00020228614,0.00015056423],"domain_scores_gemma":[0.9977293,0.00033467042,0.00034984708,0.001440602,0.000074233474,0.00007134057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039621937,0.00012737351,0.00024308175,0.00007558039,0.00029227167,0.00017885352,0.0011683025,0.00004188505,0.00007916289],"category_scores_gemma":[0.00022972826,0.00010868645,0.00013450376,0.00006596792,0.00016921267,0.00029953735,0.00010631891,0.000080690916,0.00008551332],"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.000013017717,0.00011172603,0.000057000754,0.000027945327,0.000034440767,0.000005833556,0.0005462608,0.000003099726,0.002053297,0.99498,0.000980352,0.0011870626],"study_design_scores_gemma":[0.0009025088,0.00027751425,0.0005162162,0.00024913004,0.0000195246,0.000007950192,0.000082659855,0.0028105548,0.011248401,0.98210055,0.0015352481,0.00024971852],"about_ca_topic_score_codex":0.000009896826,"about_ca_topic_score_gemma":0.0000040712534,"teacher_disagreement_score":0.73276395,"about_ca_system_score_codex":0.000008309857,"about_ca_system_score_gemma":0.000035985464,"threshold_uncertainty_score":0.44321048},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9573485,0.0005959887,0.0013346736,0.00038764955,0.00029221876,0.0015377902,0.000059685073,0.00062464527,0.037818834],"genre_scores_gemma":[0.76003736,0.00010104345,0.23676854,0.00012274295,0.00008369266,0.000048237776,0.000016903337,0.00014178251,0.0026797121],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99708307,0.00015384612,0.0010908928,0.00055167224,0.0006626277,0.00045789208],"domain_scores_gemma":[0.9963537,0.0015183663,0.00060801697,0.0011784985,0.00016763047,0.00017381735],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009723895,0.00043229558,0.0009785736,0.00017935374,0.00007975273,0.000038271923,0.00032042456,0.00022678338,0.00022852352],"category_scores_gemma":[0.0004835729,0.00039695852,0.00018076661,0.0002715534,0.00015155098,0.00034488912,0.0002176782,0.0003517725,0.00015266103],"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.000033386616,0.00077851705,0.00079899374,0.0029800779,0.00031660742,0.000059105845,0.0035998528,2.40033e-7,0.0012279705,0.9884076,0.0016338725,0.00016374113],"study_design_scores_gemma":[0.0016321182,0.00024135642,0.00006619752,0.0003740664,0.00015988704,0.00016931386,0.00060458743,0.00020650042,0.005111758,0.98784125,0.0031156554,0.00047733364],"about_ca_topic_score_codex":0.0000030887265,"about_ca_topic_score_gemma":0.0000014411513,"teacher_disagreement_score":0.23543388,"about_ca_system_score_codex":0.00005303891,"about_ca_system_score_gemma":0.000109545545,"threshold_uncertainty_score":0.99984825},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7642911,0.00012194598,0.00041426028,0.00026368306,0.0002503754,0.00081408885,0.000005388865,0.00032508286,0.23351404],"genre_scores_gemma":[0.99639356,0.0000042386077,0.00019477645,0.00016648682,0.000018764344,0.00010477259,0.000003737083,0.0000457736,0.0030679],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898124,0.000084947205,0.0003344138,0.00015813837,0.000204968,0.00023626907],"domain_scores_gemma":[0.9989852,0.00031253957,0.000054417196,0.0005710724,0.000022826014,0.0000539997],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00055671023,0.0001971589,0.0002797429,0.00004767566,0.00005918207,0.000051980587,0.00028307777,0.0000670289,0.0006581925],"category_scores_gemma":[0.00002323484,0.00012396865,0.00012084724,0.00013417221,0.00003392347,0.00006999751,0.000017023456,0.00015690764,0.0025141337],"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.000014063554,0.000035648744,0.000061026916,0.00029110094,0.00010192375,0.0000045273678,0.0011037311,0.00044524693,0.0060136286,0.9846958,0.007102175,0.00013114301],"study_design_scores_gemma":[0.0022316747,0.00020915366,0.00008252116,0.0008278882,0.000060113092,0.000065289845,0.0011703394,0.032020167,0.012534359,0.92098206,0.028747397,0.0010690538],"about_ca_topic_score_codex":0.0000034653858,"about_ca_topic_score_gemma":0.0000014175087,"teacher_disagreement_score":0.23210242,"about_ca_system_score_codex":0.000017289995,"about_ca_system_score_gemma":0.00000734759,"threshold_uncertainty_score":0.9982625},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3012135,0.0013122279,0.6814404,0.00060591905,0.0005409216,0.005389919,0.00016502425,0.0005816083,0.008750433],"genre_scores_gemma":[0.74795115,0.00021197804,0.25018996,0.000036712907,0.000054340035,0.000544005,0.000103366845,0.00020470165,0.00070375454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963491,0.0002722259,0.0014622055,0.0007427427,0.0006738048,0.0004999495],"domain_scores_gemma":[0.99504703,0.0008747776,0.0016342996,0.0015439948,0.00072004675,0.00017984958],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009467267,0.000695814,0.0017531697,0.00019904725,0.00014839227,0.00014115445,0.0004700214,0.0004599584,0.00006558466],"category_scores_gemma":[0.001097329,0.0006086636,0.00018416964,0.00033561682,0.00029876782,0.0002246056,0.0007659861,0.0005937174,0.0000028845186],"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.00005421108,0.0008712986,0.00010156989,0.018495401,0.00064418296,0.00004961486,0.006814599,0.00035308627,0.0057933885,0.9662794,0.00042259553,0.000120680124],"study_design_scores_gemma":[0.0013557147,0.00013933447,0.0000069893335,0.0048873164,0.00038433497,0.000075224976,0.0007820588,0.0057571405,0.0036405597,0.9822029,0.000060392187,0.000708022],"about_ca_topic_score_codex":0.000036517344,"about_ca_topic_score_gemma":0.000066528075,"teacher_disagreement_score":0.44673768,"about_ca_system_score_codex":0.00011630728,"about_ca_system_score_gemma":0.00040811306,"threshold_uncertainty_score":0.9996365},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8513985,0.00018931701,0.057732847,0.00069419754,0.00026184428,0.0009523171,0.00000421839,0.00026883555,0.08849789],"genre_scores_gemma":[0.9819563,0.000007029419,0.015691984,0.000054210213,0.0000047736607,0.000020031823,7.6004363e-7,0.000017885443,0.0022470406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984031,0.00008405259,0.0004236063,0.000359191,0.0004031459,0.0003269113],"domain_scores_gemma":[0.99795014,0.0005892352,0.000204939,0.0010282405,0.00012735523,0.00010009141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007391285,0.0001583507,0.00039094553,0.00017194806,0.000047553614,0.000050644412,0.0011925849,0.000056071513,0.00014913325],"category_scores_gemma":[0.00016222733,0.00014175344,0.000115791074,0.00034196436,0.0000994883,0.0004847408,0.00024266998,0.00015017434,0.00048438506],"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.000034681874,0.00014346786,0.0016059794,0.0003333,0.00006766077,0.000020482574,0.001813914,0.00002189535,0.035244085,0.9570064,0.00026365946,0.003444452],"study_design_scores_gemma":[0.0019311968,0.00045960423,0.0012195015,0.0006374445,0.000011999266,0.00006400825,0.00044408598,0.018038746,0.10087712,0.87348515,0.002221101,0.0006100167],"about_ca_topic_score_codex":0.000006423927,"about_ca_topic_score_gemma":0.0000035530948,"teacher_disagreement_score":0.13055776,"about_ca_system_score_codex":0.000023388664,"about_ca_system_score_gemma":0.000057352372,"threshold_uncertainty_score":0.62259513},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8674053,0.0027835467,0.006196357,0.0020694712,0.0027141955,0.0025483067,0.00069560856,0.0023065915,0.1132806],"genre_scores_gemma":[0.9966947,0.00005662198,0.0024169309,0.00004808569,0.000120488585,0.000032244687,0.00017335918,0.00010792379,0.0003496791],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975111,0.00012557041,0.0009738796,0.0006457889,0.00039372517,0.00034992603],"domain_scores_gemma":[0.998305,0.0003493793,0.00019445656,0.0007412645,0.000040550854,0.00036935468],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046036474,0.0006135462,0.001001709,0.0001313167,0.00007260472,0.00014411351,0.00039553584,0.0005632704,0.000058700516],"category_scores_gemma":[0.00022762382,0.00055115303,0.00022875742,0.0001216075,0.00012058105,0.000065413755,0.00018461685,0.0010166144,0.00010216829],"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.0006892052,0.000093464965,0.000046186466,0.005343523,0.0023439962,0.0006314039,0.008421636,0.0115387365,0.005436664,0.94574517,0.017351411,0.0023585735],"study_design_scores_gemma":[0.0022348391,0.00018483918,0.00042908074,0.0017924235,0.00024344663,0.00014911247,0.00037795608,0.02618777,0.0019790225,0.9635572,0.0015968368,0.0012674872],"about_ca_topic_score_codex":0.000010674789,"about_ca_topic_score_gemma":0.0000031014622,"teacher_disagreement_score":0.12928934,"about_ca_system_score_codex":0.000036528796,"about_ca_system_score_gemma":0.000059065373,"threshold_uncertainty_score":0.999694},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9589076,0.00056484714,0.006075386,0.00032073114,0.00024599332,0.00043853075,0.000026889105,0.0003717909,0.033048198],"genre_scores_gemma":[0.99906975,0.000005842665,0.0007618097,0.00007306294,0.00002076966,0.000007825099,0.0000055672326,0.000021523192,0.000033832857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992469,0.000033914766,0.00035383643,0.000105586034,0.00014248496,0.00011728191],"domain_scores_gemma":[0.9994743,0.00010381926,0.00006732082,0.00020619087,0.0000625137,0.00008586849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011454782,0.00012355552,0.0002714064,0.000024462768,0.000041816988,0.000026775755,0.00017952145,0.000052665204,0.00024595115],"category_scores_gemma":[0.0001123978,0.00011066566,0.000061154744,0.00019667762,0.000079357655,0.0000977649,0.0000129947575,0.000092599854,0.00010376278],"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.000087951186,0.000056853944,0.0006490675,0.003034858,0.00043169837,0.000043928212,0.025449656,0.004966512,0.22276779,0.73254234,0.009228428,0.000740898],"study_design_scores_gemma":[0.003514108,0.00094737374,0.0016683731,0.001252055,0.0003743793,0.00018126964,0.008659877,0.3496863,0.1859274,0.41432884,0.03091656,0.0025434408],"about_ca_topic_score_codex":0.000004227992,"about_ca_topic_score_gemma":0.0000014512713,"teacher_disagreement_score":0.3447198,"about_ca_system_score_codex":0.0000052845676,"about_ca_system_score_gemma":0.000021144058,"threshold_uncertainty_score":0.45128146},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41405866,0.0005019465,0.5616679,0.009060301,0.00046849993,0.0022662824,0.000025818,0.0005747531,0.011375793],"genre_scores_gemma":[0.9824943,0.000007645781,0.015270602,0.0002372853,0.000024776455,0.0005346339,0.000003916053,0.00001979809,0.0014070431],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985493,0.00021411496,0.00024072167,0.00027236465,0.0004016299,0.00032187445],"domain_scores_gemma":[0.997619,0.0014989129,0.0001738786,0.00055257155,0.00010364723,0.00005199479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00250144,0.00012894586,0.00017634068,0.00006776382,0.0011149053,0.00022010968,0.0010198159,0.000024707044,0.00001544217],"category_scores_gemma":[0.00008166877,0.000089536145,0.00012143982,0.00033103756,0.00005155914,0.00013086046,0.00023110303,0.00016262493,0.000012426425],"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.00008109974,0.00010660443,0.0007997538,0.000043995835,0.00013202432,0.0000042445713,0.0024676793,0.000024140287,0.00039140187,0.9907237,0.0010902218,0.004135107],"study_design_scores_gemma":[0.003315623,0.0016488164,0.00037010762,0.00009979093,0.0000991605,0.000073457784,0.003081596,0.049442988,0.008915555,0.7953644,0.13658136,0.0010071478],"about_ca_topic_score_codex":0.0000051149163,"about_ca_topic_score_gemma":0.000005872574,"teacher_disagreement_score":0.5684356,"about_ca_system_score_codex":0.000079579346,"about_ca_system_score_gemma":0.00009570436,"threshold_uncertainty_score":0.85750633},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9182941,0.00016579713,0.0030255592,0.004037989,0.00021251668,0.0008355852,0.000050199487,0.00013250427,0.07324578],"genre_scores_gemma":[0.99255526,0.000004516074,0.0038917686,0.00026879064,0.000029307112,0.00014105703,0.000007952239,0.000040088307,0.0030612492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997649,0.00039057736,0.0007752171,0.0003021533,0.00055187684,0.00033116215],"domain_scores_gemma":[0.9948745,0.0036617287,0.00054748915,0.00077407394,0.00007724359,0.00006501399],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013543445,0.00020535494,0.00055731635,0.00011106508,0.00034516715,0.000019830213,0.0006202177,0.000050562863,0.00418663],"category_scores_gemma":[0.0013020601,0.00014830263,0.00021897472,0.00058655563,0.0002843398,0.000083588835,0.0004158839,0.0003152985,0.000053116877],"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.000100710975,0.0006879486,0.004358834,0.00036895566,0.00036558104,0.00004959524,0.018311694,0.0000052666524,0.0007603088,0.9421622,0.031599145,0.0012297559],"study_design_scores_gemma":[0.0008619964,0.000087808454,0.0002489643,0.000020746049,0.00006839617,0.00018702699,0.014424492,0.00015439426,0.0011162497,0.97663057,0.005973127,0.00022622048],"about_ca_topic_score_codex":0.000062631145,"about_ca_topic_score_gemma":0.0000041868625,"teacher_disagreement_score":0.0742612,"about_ca_system_score_codex":0.000023523791,"about_ca_system_score_gemma":0.000061974104,"threshold_uncertainty_score":0.99672365},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98339653,0.000015868125,0.0010077974,0.0012773074,0.00033719814,0.0009706124,0.00010424106,0.00030924066,0.012581213],"genre_scores_gemma":[0.99588376,0.0000067830374,0.0028538408,0.00030242844,0.000042254243,0.00005602476,0.00001224874,0.000058461188,0.00078416936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99791855,0.00021306629,0.000676741,0.0003249237,0.0004934266,0.00037327124],"domain_scores_gemma":[0.9971018,0.00068233866,0.00027025808,0.0016177983,0.00016611075,0.00016168962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001353386,0.00025974592,0.00047332502,0.00016278053,0.0003929689,0.000036792535,0.00071643555,0.00011656391,0.00017380025],"category_scores_gemma":[0.00085019495,0.00015976165,0.00023906109,0.00071510323,0.0002487639,0.00014122012,0.00024704117,0.0001841103,0.00008154404],"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.00002987903,0.00010836271,0.00017149067,0.00022000738,0.0000612547,0.000008352443,0.008766935,0.000020065214,0.002574077,0.9799181,0.0077039693,0.00041746162],"study_design_scores_gemma":[0.0003273223,0.00009457193,0.00071285834,0.00024379282,0.00006444958,0.000020147105,0.002127544,0.00079272426,0.0028482925,0.9915796,0.0009668282,0.0002218915],"about_ca_topic_score_codex":0.000008404737,"about_ca_topic_score_gemma":0.000018342882,"teacher_disagreement_score":0.012487268,"about_ca_system_score_codex":0.000022260574,"about_ca_system_score_gemma":0.000043817472,"threshold_uncertainty_score":0.6514891},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57123494,0.00013132484,0.41799682,0.0020836066,0.00018215839,0.0005620731,0.000021057589,0.00046544382,0.0073225605],"genre_scores_gemma":[0.98008394,0.000012102938,0.01948895,0.00004700556,0.0000051931265,0.000028252087,0.0000021631574,0.000014191985,0.00031820612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99818474,0.00013238704,0.00036655407,0.00035742985,0.0005804989,0.00037837762],"domain_scores_gemma":[0.9978702,0.0011520342,0.00009973028,0.0005494347,0.00020851415,0.00012005634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001683156,0.00013918364,0.00027800252,0.00019524514,0.00020227126,0.00015316262,0.0005612813,0.00007886026,0.000030192565],"category_scores_gemma":[0.0009124245,0.00012630512,0.00006601763,0.00087911385,0.00046029972,0.0006470664,0.00035099775,0.00017455016,0.00014348449],"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.0000106799735,0.00006925519,0.001020416,0.00018142974,0.000012670279,0.000035456935,0.0017337285,5.154665e-7,0.0020534308,0.9929446,0.00013277696,0.0018050221],"study_design_scores_gemma":[0.00054564513,0.000040172337,0.0007531697,0.00011840652,0.0000049052046,0.000056328983,0.0002487911,0.012757327,0.0030113698,0.98214567,0.00015706639,0.00016112337],"about_ca_topic_score_codex":0.0000038725293,"about_ca_topic_score_gemma":0.0000024392918,"teacher_disagreement_score":0.40884897,"about_ca_system_score_codex":0.000010981512,"about_ca_system_score_gemma":0.000059560403,"threshold_uncertainty_score":0.5150573},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5880986,0.00008412192,0.0005996555,0.00207217,0.00052519137,0.0010428954,0.000017138525,0.002100747,0.40545946],"genre_scores_gemma":[0.9972828,0.0000068363765,0.000049764574,0.00010181467,0.000024850387,0.00017331088,0.0000048442084,0.00004413278,0.0023116553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909526,0.00005921705,0.00027396673,0.00013148173,0.00019011398,0.00024998278],"domain_scores_gemma":[0.9989232,0.00054573093,0.000035508252,0.0004243124,0.000017264456,0.000054007873],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00063012075,0.00016370401,0.00019603994,0.000077610894,0.00009706654,0.000048210568,0.0002580668,0.000054968303,0.000108784996],"category_scores_gemma":[0.000040788193,0.000105732484,0.000094264855,0.0003247735,0.000050109596,0.00005241203,0.000019445532,0.00012266097,0.002837328],"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.000008923814,0.000029007817,0.000016540696,0.00032838766,0.000095603085,0.000025539968,0.002803251,0.00036415402,0.0047811153,0.9318729,0.05950267,0.00017188906],"study_design_scores_gemma":[0.00070361677,0.00013328035,0.0000539956,0.0006126201,0.000040463263,0.000039762937,0.002426866,0.023625359,0.008233329,0.9355518,0.02792404,0.0006548323],"about_ca_topic_score_codex":0.0000010561206,"about_ca_topic_score_gemma":0.0000011122164,"teacher_disagreement_score":0.4091842,"about_ca_system_score_codex":0.000010735685,"about_ca_system_score_gemma":0.000006273311,"threshold_uncertainty_score":0.99793905},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010847608,0.0007038836,0.89189154,0.006590766,0.00020832085,0.00031705826,0.000010892527,0.0033059996,0.0958868],"genre_scores_gemma":[0.8074873,0.000010730695,0.18779531,0.0015442552,0.000028168872,0.00007130299,0.0000023603623,0.00003831332,0.0030222295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982711,0.000029527217,0.0004116008,0.0005525604,0.00041984828,0.00031534568],"domain_scores_gemma":[0.9986668,0.00022711836,0.00007649805,0.00084191567,0.00007459958,0.00011305768],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00051979185,0.00023584493,0.0002834352,0.00017481149,0.00007042683,0.0015815545,0.0011719518,0.00007194516,0.00004958055],"category_scores_gemma":[0.00010643778,0.00019851244,0.00014120092,0.0004881867,0.00010174192,0.0015611683,0.00034003606,0.00016905382,0.0011532527],"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.0000058850446,0.00018954121,0.000008496099,0.0009718635,0.000079042686,0.00037309207,0.0034939623,8.2809926e-8,0.0060034464,0.8236175,0.063087374,0.10216967],"study_design_scores_gemma":[0.00021408383,0.00012749365,0.0000057220236,0.0011104711,0.000021404052,0.0002135771,0.00004193204,0.05480632,0.034213956,0.8355795,0.073069476,0.0005960753],"about_ca_topic_score_codex":0.000006008725,"about_ca_topic_score_gemma":6.675761e-7,"teacher_disagreement_score":0.80640256,"about_ca_system_score_codex":0.000036466598,"about_ca_system_score_gemma":0.00008155776,"threshold_uncertainty_score":0.9996245},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22252898,0.0023834624,0.032635342,0.0036774268,0.001252077,0.0016424318,0.000046327074,0.002401686,0.7334323],"genre_scores_gemma":[0.9980388,0.00003641455,0.00092449225,0.0001954258,0.000021198686,0.00004366633,0.000013984876,0.000037272726,0.0006887392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920726,0.000030780677,0.00024810052,0.00013950944,0.0001795282,0.00019480838],"domain_scores_gemma":[0.99934435,0.00036863907,0.000015080514,0.00023113129,0.0000093896315,0.000031392297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004288392,0.0001465017,0.00016129111,0.000106151565,0.00003312431,0.0001617206,0.00017657118,0.00005744037,0.00021925855],"category_scores_gemma":[0.00003345146,0.000101536454,0.00004982725,0.0002509589,0.000025831716,0.0000996318,0.000008218949,0.00021194544,0.00053620007],"study_design_candidate":"simulation_or_modeling","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.000040574872,0.0002329574,0.000092163544,0.0024737183,0.00019690921,0.0006331694,0.032500494,0.20650516,0.0006091193,0.62119585,0.13275197,0.0027679112],"study_design_scores_gemma":[0.00084685313,0.0001494826,0.000041679214,0.0016736474,0.000037841295,0.0001604301,0.00079361274,0.88259286,0.00085322256,0.044794872,0.06737263,0.0006828607],"about_ca_topic_score_codex":0.000005995648,"about_ca_topic_score_gemma":0.0000050369854,"teacher_disagreement_score":0.77550983,"about_ca_system_score_codex":0.000022195385,"about_ca_system_score_gemma":0.000011651106,"threshold_uncertainty_score":0.6891946},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61025614,0.0067124465,0.006927467,0.011890319,0.00039438874,0.0010350107,0.00054395956,0.00071530737,0.36152494],"genre_scores_gemma":[0.98103034,0.00006774616,0.0009564092,0.000045974444,0.00013315567,0.00040840224,0.000053739197,0.000045285804,0.017258972],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99883515,0.000007530743,0.0004594008,0.00029014537,0.0001905484,0.00021724224],"domain_scores_gemma":[0.99809396,0.0010099489,0.00010968581,0.00064285524,0.00008518507,0.000058361144],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00022193043,0.00020122559,0.0002767421,0.000016083299,0.00015497577,0.000085757296,0.0003821168,0.00012679581,0.0035851947],"category_scores_gemma":[0.0000860056,0.00013636792,0.00027093175,0.00013078554,0.00017243437,0.00006964078,0.00005109681,0.00015297708,0.00018353351],"study_design_candidate":"bench_or_experimental","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.00010916917,0.000555846,0.00030969703,0.010896558,0.0012683052,0.000012090322,0.0025827715,0.000012036434,0.38843447,0.50441325,0.087213516,0.004192318],"study_design_scores_gemma":[0.0006932127,0.000015756345,0.00000888218,0.00073845923,0.0002860404,0.00009602228,0.0009815727,0.0036908141,0.4157896,0.13037845,0.44688395,0.00043720932],"about_ca_topic_score_codex":0.0000075083303,"about_ca_topic_score_gemma":0.0000017407754,"teacher_disagreement_score":0.3740348,"about_ca_system_score_codex":0.000024178682,"about_ca_system_score_gemma":0.000093109484,"threshold_uncertainty_score":0.99732566},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9712133,0.00089910865,0.0005531381,0.00020395646,0.0003145527,0.00079092855,0.00003251633,0.00050113164,0.025491387],"genre_scores_gemma":[0.9986562,0.000011667324,0.0008703305,0.000011548609,0.0000058033206,0.00006923094,0.0000073212123,0.000025307938,0.00034256914],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99868834,0.00015437556,0.0006327502,0.00017735494,0.00016882643,0.000178364],"domain_scores_gemma":[0.99877715,0.00025743054,0.00014004814,0.000672157,0.000112775706,0.000040410156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003199333,0.00020392124,0.00047668503,0.00018567516,0.000097329044,0.000014584745,0.0003570256,0.000065934066,0.000019733838],"category_scores_gemma":[0.00011954413,0.00015096589,0.00020658389,0.0007614037,0.00018288568,0.00006905465,0.00004101733,0.00011954695,0.000004173594],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.00011173887,0.0008050253,0.010233703,0.007739223,0.0016129805,0.000008802223,0.013632532,0.0006601437,0.50809765,0.45073238,0.0037899765,0.0025758331],"study_design_scores_gemma":[0.0019715047,0.00009288144,0.02259097,0.0044320947,0.0005040241,0.000028137107,0.0018161552,0.013019972,0.50424063,0.4488575,0.0015712805,0.0008748774],"about_ca_topic_score_codex":0.000072676456,"about_ca_topic_score_gemma":0.000070603885,"teacher_disagreement_score":0.02744294,"about_ca_system_score_codex":0.000021430864,"about_ca_system_score_gemma":0.00003214822,"threshold_uncertainty_score":0.6156211},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9493621,0.00007255269,0.012395771,0.0024169174,0.0001754686,0.0021537878,0.000058857902,0.00044596143,0.032918602],"genre_scores_gemma":[0.99500316,0.000010438201,0.0029000766,0.00046921542,0.000007096504,0.00024476025,0.000015763644,0.000025476984,0.001324009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975752,0.00033762204,0.00095969025,0.00045684396,0.00022821497,0.00044242517],"domain_scores_gemma":[0.99623346,0.0023294897,0.00026966137,0.00090568437,0.00013688167,0.00012480229],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013611201,0.0003206054,0.0007407707,0.00021001438,0.0001744049,0.000050077848,0.0004518889,0.00018519351,0.00044423642],"category_scores_gemma":[0.0011056021,0.00026361487,0.00018665941,0.0009171103,0.00034059884,0.00014930907,0.0000892023,0.00032079,0.00006532816],"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.00013366732,0.00069864286,0.0018965675,0.0005013804,0.00008902708,0.000018914161,0.00068537577,2.6637912e-7,0.0014547191,0.9919256,0.0023339395,0.00026190258],"study_design_scores_gemma":[0.0015904123,0.000030387848,0.0008588044,0.00024956,0.00006739341,0.000010155616,0.00041634231,0.00036780053,0.0037858891,0.9911557,0.0011882987,0.00027928472],"about_ca_topic_score_codex":0.000060696675,"about_ca_topic_score_gemma":0.00025787187,"teacher_disagreement_score":0.045641083,"about_ca_system_score_codex":0.000059954622,"about_ca_system_score_gemma":0.000119589145,"threshold_uncertainty_score":0.9999816},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03266646,0.00024845544,0.9181078,0.002179101,0.0004912546,0.00038879915,0.000001853718,0.00043627122,0.045480028],"genre_scores_gemma":[0.93332994,0.0000063952643,0.06388022,0.0011362683,0.000013366334,0.00005990693,0.0000010384935,0.000012238977,0.0015606245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842054,0.00009791027,0.00040424886,0.0004619117,0.0002403642,0.00037503126],"domain_scores_gemma":[0.9985453,0.00032493804,0.00009121754,0.000813256,0.000078709265,0.00014660074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008331224,0.00021756049,0.0003333608,0.0004968604,0.00025810848,0.00021361934,0.0011233708,0.000057916455,0.000021564643],"category_scores_gemma":[0.00016273174,0.00019318717,0.0001692227,0.0013327003,0.000061000195,0.00034665244,0.00026218782,0.00014976405,0.00014483983],"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.0000053751537,0.00006653377,0.00011165319,0.000058176116,0.0000469998,0.00002948155,0.0011246686,0.00001309621,0.0022910459,0.9854182,0.0007439667,0.010090813],"study_design_scores_gemma":[0.00045768166,0.00006615929,0.00017594895,0.0003911749,0.000017905739,0.000024553836,0.00028982645,0.00431076,0.0037284377,0.98620963,0.0039799362,0.0003479568],"about_ca_topic_score_codex":0.0000048647694,"about_ca_topic_score_gemma":0.0000012175584,"teacher_disagreement_score":0.9006635,"about_ca_system_score_codex":0.000015892574,"about_ca_system_score_gemma":0.000038960097,"threshold_uncertainty_score":0.7877944},"labels":[],"label_agreement":null}]}