{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:375PYKX6V73EMESNSVLU7HJF7W","short_pith_number":"pith:375PYKX6","schema_version":"1.0","canonical_sha256":"dffafc2afeaff646124d95574f9d25fd81abdcf78de6639c35d4f637b35f27f6","source":{"kind":"arxiv","id":"1111.1489","version":2},"attestation_state":"computed","paper":{"title":"Euler's Partition Theorem with Upper Bounds on Multiplicities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Ae Ja Yee, Albert J. W. Zhu, William Y. C. Chen","submitted_at":"2011-11-07T05:11:54Z","abstract_excerpt":"We show that the number of partitions of n with alternating sum k such that the multiplicity of each part is bounded by 2m+1 equals the number of partitions of n with k odd parts such that the multiplicity of each even part is bounded by m. The first proof relies on two formulas with two parameters that are related to the four-parameter formulas of Boulet. We also give a combinatorial proof of this result by using Sylvester's bijection, which implies a stronger partition theorem. For m=0, our result reduces to Bessenrodt's refinement of Euler's Theorem. If the alternating sum and the number of"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1111.1489","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-07T05:11:54Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"01916144896b6841d3d9fad306edf51519e6edbceb9bab8c5c572b401d2f64a1","abstract_canon_sha256":"594c77469e0f5d489e9523df2e0a8b64470c2aadb3506bb4457409b60b9dfe8e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:48:23.406508Z","signature_b64":"mWEVVsZ6meQ2pHhxweSSesgNj4OoexWZTMg0+Vn6BAiydy4pi2nE/qfo8rWgdzW9jpYUXP7Bh+JFnYcNWij4CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dffafc2afeaff646124d95574f9d25fd81abdcf78de6639c35d4f637b35f27f6","last_reissued_at":"2026-05-18T03:48:23.405822Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:48:23.405822Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Euler's Partition Theorem with Upper Bounds on Multiplicities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Ae Ja Yee, Albert J. W. Zhu, William Y. C. Chen","submitted_at":"2011-11-07T05:11:54Z","abstract_excerpt":"We show that the number of partitions of n with alternating sum k such that the multiplicity of each part is bounded by 2m+1 equals the number of partitions of n with k odd parts such that the multiplicity of each even part is bounded by m. The first proof relies on two formulas with two parameters that are related to the four-parameter formulas of Boulet. We also give a combinatorial proof of this result by using Sylvester's bijection, which implies a stronger partition theorem. For m=0, our result reduces to Bessenrodt's refinement of Euler's Theorem. If the alternating sum and the number of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.1489","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1111.1489","created_at":"2026-05-18T03:48:23.405928+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.1489v2","created_at":"2026-05-18T03:48:23.405928+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.1489","created_at":"2026-05-18T03:48:23.405928+00:00"},{"alias_kind":"pith_short_12","alias_value":"375PYKX6V73E","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_16","alias_value":"375PYKX6V73EMESN","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_8","alias_value":"375PYKX6","created_at":"2026-05-18T12:26:18.847500+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/375PYKX6V73EMESNSVLU7HJF7W","json":"https://pith.science/pith/375PYKX6V73EMESNSVLU7HJF7W.json","graph_json":"https://pith.science/api/pith-number/375PYKX6V73EMESNSVLU7HJF7W/graph.json","events_json":"https://pith.science/api/pith-number/375PYKX6V73EMESNSVLU7HJF7W/events.json","paper":"https://pith.science/paper/375PYKX6"},"agent_actions":{"view_html":"https://pith.science/pith/375PYKX6V73EMESNSVLU7HJF7W","download_json":"https://pith.science/pith/375PYKX6V73EMESNSVLU7HJF7W.json","view_paper":"https://pith.science/paper/375PYKX6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.1489&json=true","fetch_graph":"https://pith.science/api/pith-number/375PYKX6V73EMESNSVLU7HJF7W/graph.json","fetch_events":"https://pith.science/api/pith-number/375PYKX6V73EMESNSVLU7HJF7W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/375PYKX6V73EMESNSVLU7HJF7W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/375PYKX6V73EMESNSVLU7HJF7W/action/storage_attestation","attest_author":"https://pith.science/pith/375PYKX6V73EMESNSVLU7HJF7W/action/author_attestation","sign_citation":"https://pith.science/pith/375PYKX6V73EMESNSVLU7HJF7W/action/citation_signature","submit_replication":"https://pith.science/pith/375PYKX6V73EMESNSVLU7HJF7W/action/replication_record"}},"created_at":"2026-05-18T03:48:23.405928+00:00","updated_at":"2026-05-18T03:48:23.405928+00:00"}