{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:M3UWGDBWHNDZXEUDWE3ZVJNMI6","short_pith_number":"pith:M3UWGDBW","schema_version":"1.0","canonical_sha256":"66e9630c363b479b9283b1379aa5ac47929339d82a0c00088fd2abcaa5f7be7a","source":{"kind":"arxiv","id":"1108.4391","version":2},"attestation_state":"computed","paper":{"title":"Formulae for the number of partitions of n into at most m parts (using the quasi-polynomial ansatz)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Andrew V. Sills, Doron Zeilberger","submitted_at":"2011-08-22T17:57:43Z","abstract_excerpt":"The purpose of this short article is to announce, and briefly describe, a Maple package, PARTITIONS, that (inter alia) completely automatically discovers, and then proves, explicit expressions (as sums of quasi-polynomials) for pm(n) for any desired m. We do this to demonstrate the power of \"rigorous guessing\" as facilitated by the quasi-polynomial ansatz."},"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":"1108.4391","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-22T17:57:43Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"697cea33ad16461107079a406de288e258d8508be1dca51b80b86691771b7226","abstract_canon_sha256":"b22e2aa6bdc7ea9e112bac87c67c5b20e0ed05c2cabb7fac4b4b9c4b0009122b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:18.393033Z","signature_b64":"61HLoYiNGRvoAtG3o8eO7hrFASRku5BiCnModpjtKZVkCl8C4Nv7uyD5hIC8+OAQ+e3gYCpXDCK0YC5vl667Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66e9630c363b479b9283b1379aa5ac47929339d82a0c00088fd2abcaa5f7be7a","last_reissued_at":"2026-05-17T23:59:18.392622Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:18.392622Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Formulae for the number of partitions of n into at most m parts (using the quasi-polynomial ansatz)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Andrew V. Sills, Doron Zeilberger","submitted_at":"2011-08-22T17:57:43Z","abstract_excerpt":"The purpose of this short article is to announce, and briefly describe, a Maple package, PARTITIONS, that (inter alia) completely automatically discovers, and then proves, explicit expressions (as sums of quasi-polynomials) for pm(n) for any desired m. We do this to demonstrate the power of \"rigorous guessing\" as facilitated by the quasi-polynomial ansatz."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.4391","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":"1108.4391","created_at":"2026-05-17T23:59:18.392684+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.4391v2","created_at":"2026-05-17T23:59:18.392684+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.4391","created_at":"2026-05-17T23:59:18.392684+00:00"},{"alias_kind":"pith_short_12","alias_value":"M3UWGDBWHNDZ","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_16","alias_value":"M3UWGDBWHNDZXEUD","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_8","alias_value":"M3UWGDBW","created_at":"2026-05-18T12:26:34.985390+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/M3UWGDBWHNDZXEUDWE3ZVJNMI6","json":"https://pith.science/pith/M3UWGDBWHNDZXEUDWE3ZVJNMI6.json","graph_json":"https://pith.science/api/pith-number/M3UWGDBWHNDZXEUDWE3ZVJNMI6/graph.json","events_json":"https://pith.science/api/pith-number/M3UWGDBWHNDZXEUDWE3ZVJNMI6/events.json","paper":"https://pith.science/paper/M3UWGDBW"},"agent_actions":{"view_html":"https://pith.science/pith/M3UWGDBWHNDZXEUDWE3ZVJNMI6","download_json":"https://pith.science/pith/M3UWGDBWHNDZXEUDWE3ZVJNMI6.json","view_paper":"https://pith.science/paper/M3UWGDBW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.4391&json=true","fetch_graph":"https://pith.science/api/pith-number/M3UWGDBWHNDZXEUDWE3ZVJNMI6/graph.json","fetch_events":"https://pith.science/api/pith-number/M3UWGDBWHNDZXEUDWE3ZVJNMI6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M3UWGDBWHNDZXEUDWE3ZVJNMI6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M3UWGDBWHNDZXEUDWE3ZVJNMI6/action/storage_attestation","attest_author":"https://pith.science/pith/M3UWGDBWHNDZXEUDWE3ZVJNMI6/action/author_attestation","sign_citation":"https://pith.science/pith/M3UWGDBWHNDZXEUDWE3ZVJNMI6/action/citation_signature","submit_replication":"https://pith.science/pith/M3UWGDBWHNDZXEUDWE3ZVJNMI6/action/replication_record"}},"created_at":"2026-05-17T23:59:18.392684+00:00","updated_at":"2026-05-17T23:59:18.392684+00:00"}