{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001000816,0.0002761279,0.00044746,0.001072936,0.001659181,0.002206543,0.000453406,0.0003219546,0.005029588],"category_scores_gemma":[0.002927582,0.0004444278,0.0004772239,0.0004341247,0.002898626,0.003473451,0.001474261,0.00136513,0.000664884],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007898181,"about_ca_system_score_gemma":0.0006806926,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006812513,"about_ca_topic_score_gemma":0.001013629,"domain_scores_codex":[0.9990699,0.0001368363,0.00006930564,0.0001631535,0.0003202442,0.0002406324],"domain_scores_gemma":[0.9980261,0.0005595399,0.0003766604,0.0002570249,0.0003306582,0.000449977],"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.0004594254,0.00009291508,0.005024913,0.0001830236,0.00002003773,0.0007895297,0.001572552,0.00600605,0.01723064,0.9474245,0.001569685,0.01962673],"study_design_scores_gemma":[0.0001196081,0.0004611321,0.004696423,0.0001394677,0.0000473027,0.002009935,0.002694718,0.02462504,0.04451932,0.8907114,0.02984297,0.000132768],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8617997,0.0007263466,0.08734623,0.0005933639,0.0001562429,0.0001014884,0.0002162373,0.0002854355,0.04877497],"genre_scores_gemma":[0.9683148,0.0002165397,0.02641319,0.00006458011,0.00007539818,0.0000306878,0.0002547629,0.0000387669,0.004591264],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005029588,"threshold_uncertainty_score":0.01682568,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004679568,0.00109009,0.0009921518,0.001771204,0.001863709,0.004802105,0.003910315,0.001737241,0.01017214],"category_scores_gemma":[0.02282976,0.001667264,0.002875583,0.001781346,0.005420968,0.015589,0.008318095,0.006879522,0.002557881],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00188183,"about_ca_system_score_gemma":0.002144076,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001762062,"about_ca_topic_score_gemma":0.001761442,"domain_scores_codex":[0.9943627,0.001509113,0.0003738379,0.001045807,0.002019858,0.0006886516],"domain_scores_gemma":[0.9893144,0.007514637,0.0004053462,0.001810011,0.0007509891,0.0002045314],"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.00003364793,0.00002782598,0.0001988514,0.0001074245,0.00002713081,0.0001244919,0.0004712866,0.001904124,0.001624323,0.9788023,0.003180524,0.01349807],"study_design_scores_gemma":[0.00003181293,0.00002636019,0.00009325778,0.00004574749,0.00003506525,0.0001340168,0.0001482682,0.01417703,0.006016982,0.9688256,0.01043979,0.00002620609],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01911481,0.0002737148,0.9502497,0.001928484,0.000268746,0.0001374276,0.0003453522,0.002901184,0.02478054],"genre_scores_gemma":[0.5944363,0.0009061339,0.3813623,0.002516855,0.0005135288,0.0005343127,0.001545878,0.001875415,0.01630917],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01017214,"threshold_uncertainty_score":0.03402925,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001427146,0.001203602,0.0008792036,0.003631676,0.001596081,0.002304433,0.001647413,0.00114394,0.005881392],"category_scores_gemma":[0.002479242,0.0003481501,0.0009599806,0.002630479,0.005814491,0.004713517,0.003369551,0.003415808,0.001378226],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0017389,"about_ca_system_score_gemma":0.0005050038,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009824899,"about_ca_topic_score_gemma":0.0004902388,"domain_scores_codex":[0.9988557,0.0003720023,0.00005354673,0.0002652848,0.0003349688,0.0001185124],"domain_scores_gemma":[0.9990551,0.000271321,0.0001973744,0.0001753234,0.0001804826,0.0001205212],"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.000004710661,0.000002359284,0.0000463898,0.00001586817,0.000002973624,0.00001675783,0.00007727974,0.000274215,0.0002640482,0.9952676,0.0005664082,0.003461417],"study_design_scores_gemma":[0.000006309453,0.0000318346,0.0001745669,0.00001900236,0.000006164847,0.0001191383,0.0000708076,0.003377106,0.0004453989,0.9796298,0.01610762,0.00001221887],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04644912,0.01058222,0.8257722,0.003165218,0.001403219,0.00010106,0.0004212676,0.000562645,0.1115431],"genre_scores_gemma":[0.7600001,0.00761228,0.1948522,0.0009427747,0.003899997,0.0002775935,0.0004800423,0.0004596456,0.03147528],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005881392,"threshold_uncertainty_score":0.01967525,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005542033,0.0006239762,0.0006078685,0.001659935,0.001660368,0.00180203,0.0007845666,0.0008307988,0.006003123],"category_scores_gemma":[0.00456531,0.0004061017,0.0005113308,0.001315521,0.002864476,0.00403121,0.001849942,0.001422308,0.00101624],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009967192,"about_ca_system_score_gemma":0.0004735195,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001149475,"about_ca_topic_score_gemma":0.001334534,"domain_scores_codex":[0.999166,0.0001515338,0.00006768403,0.0002152552,0.0002466157,0.0001530278],"domain_scores_gemma":[0.9968226,0.001561381,0.0005524915,0.0003813329,0.0003743623,0.00030792],"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.00008046081,0.00003194262,0.001344697,0.0001096609,0.000007408395,0.0002728821,0.0006824038,0.003317237,0.007189744,0.968991,0.0008500346,0.0171225],"study_design_scores_gemma":[0.00001751781,0.00007673584,0.0007844265,0.00005314682,0.00001448748,0.0006572888,0.0003764066,0.02379921,0.006766814,0.9577219,0.009692616,0.00003937258],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.658431,0.001855156,0.2869112,0.0007546582,0.0001987417,0.00007811085,0.0002118613,0.0003834158,0.05117584],"genre_scores_gemma":[0.9341336,0.0005933194,0.0486899,0.0001605845,0.0001394512,0.0001115868,0.0002639055,0.000122925,0.01578471],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006003123,"threshold_uncertainty_score":0.02008241,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}