{"id":"W1542569653","doi":"10.1090/s0002-9939-02-06460-2","title":"A proof of a partition theorem for [ℚ]ⁿ","year":2002,"lang":"en","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Partition (number theory); Algorithm; Class (philosophy); Computer science; Annotation; Mathematics; Discrete mathematics; Combinatorics; Artificial intelligence","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002116487,0.00008811724,0.000248808,0.000009636439,0.00006407921,0.00001608386,0.0006266101,0.00002038338,0.00000985149],"category_scores_gemma":[0.0001900476,0.00005336709,0.0002755547,0.0003833865,0.0003958722,0.000159832,0.0001556687,0.00006340149,0.000001697807],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001550261,"about_ca_system_score_gemma":0.000005133842,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.395893e-7,"about_ca_topic_score_gemma":1.639755e-8,"domain_scores_codex":[0.9992054,0.000003779726,0.0002366899,0.0001637898,0.0002111103,0.0001792748],"domain_scores_gemma":[0.9991459,0.0001332528,0.0004016295,0.0001389078,0.0001438823,0.00003649087],"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.000005232791,0.0002364824,0.0001302298,0.0003018506,0.00003231107,1.61451e-8,0.002838109,0.000006628511,0.008959085,0.9774154,0.001685297,0.008389362],"study_design_scores_gemma":[0.0001666907,0.0001968657,0.0001312395,0.00006023187,0.00001862866,0.000004069988,0.0003844539,0.06250426,0.04437648,0.8919046,0.0001540689,0.00009841338],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3211966,0.00005959715,0.6682006,0.00358529,0.00003540684,0.0008093772,0.000004962169,0.00009924379,0.006009005],"genre_scores_gemma":[0.8364977,0.000005687295,0.1631304,0.0002061371,0.00001785224,0.00004795061,4.676295e-8,0.000005896396,0.00008839215],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5153011,"threshold_uncertainty_score":0.2176247,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01997122170346638,"score_gpt":0.2475283934426009,"score_spread":0.2275571717391345,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}