{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":4,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":4,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"664804354909","filters":{"venue":"Communications in Mathematics"}},"results":[{"id":"W4387696876","doi":"10.46298/cm.11138","title":"Well-Rounded ideal lattices of cyclic cubic and quartic fields","year":2023,"lang":"en","type":"article","venue":"Communications in Mathematics","topic":"Rings, Modules, and Algebras","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University of Edmonton","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quartic function; Ideal (ethics); Mathematics; Prime (order theory); Quartic surface; Prime ideal; Pure mathematics; Minimal ideal; Field (mathematics); Cyclic group; Algebraic number field; Combinatorics; Maximal ideal; Law","authors":[{"name":"Dat T. Tran","is_ca":true},{"name":"Nam H. Le","is_ca":true},{"name":"Ha Thanh Nguyen Tran","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1073506051184094,"gpt":0.3655069569783898,"spread":0.2581563518599804,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007718928,0.0001326067,0.000323389,0.0002162544,0.0001215651,0.00003637904,0.000723434,0.00009692804,0.0000282662],"category_scores_gemma":[0.0006261741,0.000127714,0.00005573974,0.0004813573,0.000226755,0.0001128119,0.0003866375,0.0002214298,0.00006837415],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002267913,"about_ca_system_score_gemma":0.00002565546,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002692082,"about_ca_topic_score_gemma":0.0002538293,"domain_scores_codex":[0.9987706,0.00009828492,0.0006117405,0.0001388484,0.0001744192,0.0002060851],"domain_scores_gemma":[0.9959084,0.002120477,0.000225199,0.001649081,0.00005241141,0.00004437664],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004127024,0.0005510073,0.002862674,0.001013708,0.00006191787,0.000002611586,0.01560753,0.00002150469,0.0004952541,0.9757345,0.00189356,0.001751601],"study_design_scores_gemma":[0.0003164505,0.0000270856,0.00194936,0.0002733608,0.00003637234,0.000006734295,0.002949648,0.01668264,0.0003806842,0.9766441,0.0005732097,0.0001603562],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9852402,0.0004374486,0.0007593573,0.001095986,0.00004557952,0.0002841614,0.000003733443,0.0001401088,0.01199346],"genre_scores_gemma":[0.9481773,0.001216067,0.04994275,0.00002728339,0.00001494466,0.00004818444,0.000007210027,0.00002680759,0.0005394148],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0491834,"threshold_uncertainty_score":0.5208027,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4402509715","doi":"10.46298/cm.12627","title":"Proving Properties of $\\varphi$-Representations with the Walnut Theorem-Prover","year":2024,"lang":"en","type":"article","venue":"Communications in Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Simple (philosophy); Mathematical proof; Mathematics; Automaton; Automated theorem proving; Algebra over a field; Mathematical induction; Calculus (dental); Discrete mathematics; Pure mathematics; Algorithm; Theoretical computer science; Computer science; Epistemology","authors":[{"name":"Jeffrey Shallit","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04536069003343324,"gpt":0.2867431072126072,"spread":0.241382417179174,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006034534,0.00008897484,0.0001159611,0.0001013808,0.0001327585,0.0001684536,0.0022876,0.00002564435,0.000005592565],"category_scores_gemma":[0.00007978137,0.00004944192,0.00003606357,0.0005803305,0.0003020262,0.0003291534,0.0006481574,0.0001795175,0.00001833227],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002519124,"about_ca_system_score_gemma":0.00008393339,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001690936,"about_ca_topic_score_gemma":0.00003028546,"domain_scores_codex":[0.9992198,0.0001080302,0.0002534759,0.0001329538,0.0001690901,0.0001167022],"domain_scores_gemma":[0.9969207,0.0005578656,0.00007490101,0.002370825,0.00006037388,0.00001531475],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[7.499184e-7,0.0001053527,0.00002774527,0.0001384898,0.00001831313,8.553047e-7,0.01479053,0.00007899145,0.001504946,0.9782526,0.0001966932,0.004884759],"study_design_scores_gemma":[0.0001233004,0.00002935297,0.0001110401,0.0008706966,0.00002473363,0.00002862421,0.003858,0.775206,0.003864434,0.214046,0.001670059,0.0001677248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1312974,0.010931,0.7753754,0.03084366,0.0002211852,0.002060992,0.00001194073,0.0008525209,0.04840592],"genre_scores_gemma":[0.918505,0.00008018282,0.08091825,0.00004765489,0.000007985085,0.0001137625,0.000001379458,0.00001147234,0.0003142914],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7872076,"threshold_uncertainty_score":0.4250968,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4382490845","doi":"10.46298/cm.11527","title":"Center of Mass Technique and Affine Geometry","year":2024,"lang":"en","type":"article","venue":"Communications in Mathematics","topic":"Mathematics and Applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Center (category theory); Geometry; Center of mass (relativistic); Affine transformation; Mathematics; Space (punctuation); Field (mathematics); Affine space; Physics; Pure mathematics; Classical mechanics; Computer science","authors":[{"name":"Askold Khovanskiĭ","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08381309061187092,"gpt":0.3854341243134861,"spread":0.3016210337016151,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007694131,0.0001384768,0.0002854198,0.0002978471,0.00005835629,0.00004518789,0.0006305649,0.00008997282,0.00007048225],"category_scores_gemma":[0.0002938044,0.000124457,0.00005956081,0.0005688537,0.0001819474,0.00007372937,0.0003156135,0.000245729,0.0000144404],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003576126,"about_ca_system_score_gemma":0.00002885867,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002966518,"about_ca_topic_score_gemma":0.00001070455,"domain_scores_codex":[0.9988925,0.00004280718,0.00062587,0.000150299,0.0001456514,0.0001428254],"domain_scores_gemma":[0.9968111,0.001320231,0.0001193749,0.001650433,0.00006096521,0.00003792302],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[6.128002e-7,0.0004567148,0.00009897151,0.001636073,0.00002943273,9.287832e-7,0.001309528,7.010676e-7,0.003510932,0.9894435,0.001913042,0.001599568],"study_design_scores_gemma":[0.0001378046,0.00001582045,0.00002226457,0.0009949829,0.00004030788,0.00003043021,0.000482557,0.0149309,0.001707559,0.9704339,0.01103221,0.0001712764],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06392817,0.006247234,0.7299296,0.005846802,0.0001543652,0.004508428,0.0002607181,0.0008706256,0.1882541],"genre_scores_gemma":[0.3389779,0.0006276573,0.6592668,0.000009680794,0.0000112636,0.0003010426,0.00001002632,0.00003636618,0.0007591973],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2750497,"threshold_uncertainty_score":0.5075209,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4401259877","doi":"10.46298/cm.12695","title":"Dyck Words, Pattern Avoidance, and Automatic Sequences","year":2024,"lang":"en","type":"article","venue":"Communications in Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Winnipeg; Thompson Rivers University; University of Waterloo","funders":"","keywords":"Mathematics; Binary number; Bounded function; Parenthesis; Combinatorics; Word (group theory); Repetition (rhetorical device); Morse code; Upper and lower bounds; Discrete mathematics; Counterexample; Arithmetic; Computer science; Geometry; Mathematical analysis; Linguistics","authors":[{"name":"Lucas Mol","is_ca":true},{"name":"Narad Rampersad","is_ca":true},{"name":"Jeffrey Shallit","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03426910240024929,"gpt":0.3052477267424467,"spread":0.2709786243421974,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006249734,0.0001096534,0.0001487777,0.0001594872,0.0001089231,0.0003555068,0.001780134,0.00004400298,0.00001423576],"category_scores_gemma":[0.00006551221,0.0000953289,0.00002925487,0.00049279,0.00015009,0.0003885772,0.0007762338,0.0002045866,0.00008647057],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003541546,"about_ca_system_score_gemma":0.00004149126,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001009499,"about_ca_topic_score_gemma":0.00002416832,"domain_scores_codex":[0.9991365,0.00008992486,0.0003074962,0.0001836204,0.0001273831,0.0001550489],"domain_scores_gemma":[0.9973361,0.0007859251,0.00005095031,0.001773178,0.0000174335,0.00003645153],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[7.618436e-8,0.0001086711,0.0004732824,0.0003557664,0.00001782884,0.00001020634,0.01094416,0.00001081115,0.0001249554,0.7801831,0.0003975407,0.2073736],"study_design_scores_gemma":[0.00004292534,0.000007632812,0.0004084603,0.0004858453,0.000004319681,0.00003461988,0.0003445818,0.7243934,0.00003378018,0.2727105,0.001423719,0.0001101404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07713513,0.0167411,0.8824298,0.007311008,0.0003166379,0.0004353806,0.000008807521,0.001228803,0.01439328],"genre_scores_gemma":[0.799001,0.0007342421,0.1998984,0.000112625,0.0000103919,0.00004941974,0.000002543022,0.00001047115,0.0001808913],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7243826,"threshold_uncertainty_score":0.3887399,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}