{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:56LW4MTCKWVREHVAQSCGVCBYYM","short_pith_number":"pith:56LW4MTC","schema_version":"1.0","canonical_sha256":"ef976e326255ab121ea084846a8838c3120db19a5f123c6ff7b5da10ac0fe714","source":{"kind":"arxiv","id":"1205.5991","version":2},"attestation_state":"computed","paper":{"title":"Efficient implementation of the Hardy-Ramanujan-Rademacher formula","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Fredrik Johansson","submitted_at":"2012-05-27T18:12:57Z","abstract_excerpt":"We describe how the Hardy-Ramanujan-Rademacher formula can be implemented to allow the partition function $p(n)$ to be computed with softly optimal complexity $O(n^{1/2+o(1)})$ and very little overhead. A new implementation based on these techniques achieves speedups in excess of a factor 500 over previously published software and has been used by the author to calculate $p(10^{19})$, an exponent twice as large as in previously reported computations.\n  We also investigate performance for multi-evaluation of $p(n)$, where our implementation of the Hardy-Ramanujan-Rademacher formula becomes supe"},"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":"1205.5991","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2012-05-27T18:12:57Z","cross_cats_sorted":[],"title_canon_sha256":"ccddf9024cb7df1d7deea7769bca7f5821668ccb6d3fe2e0f6981d7c6e49bbb5","abstract_canon_sha256":"557126af177144aea789df8916c4441019af2e59ba7140a5fbd4043bf191e832"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:36.191686Z","signature_b64":"zfa+F9cI6eK2TITaEu+MPGKlVOGz5P6CFpJjlN1DUb2J/MflvTUtJQr4afjicxnBG0o2F5/x7GKTyBKfUxriCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef976e326255ab121ea084846a8838c3120db19a5f123c6ff7b5da10ac0fe714","last_reissued_at":"2026-05-17T23:53:36.190762Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:36.190762Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient implementation of the Hardy-Ramanujan-Rademacher formula","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Fredrik Johansson","submitted_at":"2012-05-27T18:12:57Z","abstract_excerpt":"We describe how the Hardy-Ramanujan-Rademacher formula can be implemented to allow the partition function $p(n)$ to be computed with softly optimal complexity $O(n^{1/2+o(1)})$ and very little overhead. A new implementation based on these techniques achieves speedups in excess of a factor 500 over previously published software and has been used by the author to calculate $p(10^{19})$, an exponent twice as large as in previously reported computations.\n  We also investigate performance for multi-evaluation of $p(n)$, where our implementation of the Hardy-Ramanujan-Rademacher formula becomes supe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.5991","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":"1205.5991","created_at":"2026-05-17T23:53:36.190928+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.5991v2","created_at":"2026-05-17T23:53:36.190928+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.5991","created_at":"2026-05-17T23:53:36.190928+00:00"},{"alias_kind":"pith_short_12","alias_value":"56LW4MTCKWVR","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"56LW4MTCKWVREHVA","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"56LW4MTC","created_at":"2026-05-18T12:26:53.410803+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/56LW4MTCKWVREHVAQSCGVCBYYM","json":"https://pith.science/pith/56LW4MTCKWVREHVAQSCGVCBYYM.json","graph_json":"https://pith.science/api/pith-number/56LW4MTCKWVREHVAQSCGVCBYYM/graph.json","events_json":"https://pith.science/api/pith-number/56LW4MTCKWVREHVAQSCGVCBYYM/events.json","paper":"https://pith.science/paper/56LW4MTC"},"agent_actions":{"view_html":"https://pith.science/pith/56LW4MTCKWVREHVAQSCGVCBYYM","download_json":"https://pith.science/pith/56LW4MTCKWVREHVAQSCGVCBYYM.json","view_paper":"https://pith.science/paper/56LW4MTC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.5991&json=true","fetch_graph":"https://pith.science/api/pith-number/56LW4MTCKWVREHVAQSCGVCBYYM/graph.json","fetch_events":"https://pith.science/api/pith-number/56LW4MTCKWVREHVAQSCGVCBYYM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/56LW4MTCKWVREHVAQSCGVCBYYM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/56LW4MTCKWVREHVAQSCGVCBYYM/action/storage_attestation","attest_author":"https://pith.science/pith/56LW4MTCKWVREHVAQSCGVCBYYM/action/author_attestation","sign_citation":"https://pith.science/pith/56LW4MTCKWVREHVAQSCGVCBYYM/action/citation_signature","submit_replication":"https://pith.science/pith/56LW4MTCKWVREHVAQSCGVCBYYM/action/replication_record"}},"created_at":"2026-05-17T23:53:36.190928+00:00","updated_at":"2026-05-17T23:53:36.190928+00:00"}