{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001086453,0.0008837575,0.0008534482,0.001398679,0.002807901,0.002350447,0.001808173,0.001022585,0.02707417],"category_scores_gemma":[0.003361294,0.0008789976,0.002351475,0.001734812,0.003076244,0.006353336,0.004647706,0.004807842,0.00563485],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002915531,"about_ca_system_score_gemma":0.001011713,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004159002,"about_ca_topic_score_gemma":0.003081456,"domain_scores_codex":[0.9986765,0.0001531912,0.00005952873,0.000349624,0.0004658486,0.0002953099],"domain_scores_gemma":[0.998312,0.0007265377,0.00008351594,0.0002201036,0.0005127572,0.0001449764],"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.0000427693,0.00001708467,0.0001368693,0.0001000801,0.0000206533,0.00008695084,0.0002912829,0.0004023757,0.001046646,0.9725431,0.01310637,0.01220585],"study_design_scores_gemma":[0.00003499807,0.00002541191,0.0003699203,0.00004534793,0.00002898237,0.0001801237,0.0001190888,0.002108395,0.0019525,0.9171357,0.07797676,0.00002279333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03006413,0.003152224,0.6194298,0.00990831,0.0039126,0.0001920029,0.00175261,0.001445145,0.3301431],"genre_scores_gemma":[0.6084709,0.003507847,0.2215492,0.008465399,0.0030174,0.000708988,0.005189455,0.002203901,0.1468869],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02707417,"threshold_uncertainty_score":0.09057206,"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."}}