{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:56LW4MTCKWVREHVAQSCGVCBYYM","short_pith_number":"pith:56LW4MTC","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"},"canonical_sha256":"ef976e326255ab121ea084846a8838c3120db19a5f123c6ff7b5da10ac0fe714","source":{"kind":"arxiv","id":"1205.5991","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.5991","created_at":"2026-05-17T23:53:36Z"},{"alias_kind":"arxiv_version","alias_value":"1205.5991v2","created_at":"2026-05-17T23:53:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.5991","created_at":"2026-05-17T23:53:36Z"},{"alias_kind":"pith_short_12","alias_value":"56LW4MTCKWVR","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"56LW4MTCKWVREHVA","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"56LW4MTC","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:56LW4MTCKWVREHVAQSCGVCBYYM","target":"record","payload":{"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"},"canonical_sha256":"ef976e326255ab121ea084846a8838c3120db19a5f123c6ff7b5da10ac0fe714","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"},"source_kind":"arxiv","source_id":"1205.5991","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:53:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CKx+bUB0uQe/qP0ANU8X3FOlLDp9ZqNKq8/cGt+adXXV47onDqhpeOqT2CZpTWyAiUbA0fKUJCJFSJQNU/thAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:39:15.404593Z"},"content_sha256":"0d947f97a38761b44c8f5f008adee23625a0f51156d8daa4934315cf61624f95","schema_version":"1.0","event_id":"sha256:0d947f97a38761b44c8f5f008adee23625a0f51156d8daa4934315cf61624f95"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:56LW4MTCKWVREHVAQSCGVCBYYM","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:53:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aUsfEzFvvb2ndXaK0KcuVIrUGnG9M1yq+wW11DtWIhj9TK6sj5eWZpFcrrNEkCz4h/OWEhsbPGJTvRadzCEDBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:39:15.404973Z"},"content_sha256":"4ce5516e4cf669e895ec7e5e3ad79651e8cf30a031f17f1a64fa4d9a73c54b6c","schema_version":"1.0","event_id":"sha256:4ce5516e4cf669e895ec7e5e3ad79651e8cf30a031f17f1a64fa4d9a73c54b6c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/56LW4MTCKWVREHVAQSCGVCBYYM/bundle.json","state_url":"https://pith.science/pith/56LW4MTCKWVREHVAQSCGVCBYYM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/56LW4MTCKWVREHVAQSCGVCBYYM/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T03:39:15Z","links":{"resolver":"https://pith.science/pith/56LW4MTCKWVREHVAQSCGVCBYYM","bundle":"https://pith.science/pith/56LW4MTCKWVREHVAQSCGVCBYYM/bundle.json","state":"https://pith.science/pith/56LW4MTCKWVREHVAQSCGVCBYYM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/56LW4MTCKWVREHVAQSCGVCBYYM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:56LW4MTCKWVREHVAQSCGVCBYYM","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"557126af177144aea789df8916c4441019af2e59ba7140a5fbd4043bf191e832","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2012-05-27T18:12:57Z","title_canon_sha256":"ccddf9024cb7df1d7deea7769bca7f5821668ccb6d3fe2e0f6981d7c6e49bbb5"},"schema_version":"1.0","source":{"id":"1205.5991","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.5991","created_at":"2026-05-17T23:53:36Z"},{"alias_kind":"arxiv_version","alias_value":"1205.5991v2","created_at":"2026-05-17T23:53:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.5991","created_at":"2026-05-17T23:53:36Z"},{"alias_kind":"pith_short_12","alias_value":"56LW4MTCKWVR","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"56LW4MTCKWVREHVA","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"56LW4MTC","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:4ce5516e4cf669e895ec7e5e3ad79651e8cf30a031f17f1a64fa4d9a73c54b6c","target":"graph","created_at":"2026-05-17T23:53:36Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Fredrik Johansson","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2012-05-27T18:12:57Z","title":"Efficient implementation of the Hardy-Ramanujan-Rademacher formula"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.5991","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0d947f97a38761b44c8f5f008adee23625a0f51156d8daa4934315cf61624f95","target":"record","created_at":"2026-05-17T23:53:36Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"557126af177144aea789df8916c4441019af2e59ba7140a5fbd4043bf191e832","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2012-05-27T18:12:57Z","title_canon_sha256":"ccddf9024cb7df1d7deea7769bca7f5821668ccb6d3fe2e0f6981d7c6e49bbb5"},"schema_version":"1.0","source":{"id":"1205.5991","kind":"arxiv","version":2}},"canonical_sha256":"ef976e326255ab121ea084846a8838c3120db19a5f123c6ff7b5da10ac0fe714","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ef976e326255ab121ea084846a8838c3120db19a5f123c6ff7b5da10ac0fe714","first_computed_at":"2026-05-17T23:53:36.190762Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:36.190762Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zfa+F9cI6eK2TITaEu+MPGKlVOGz5P6CFpJjlN1DUb2J/MflvTUtJQr4afjicxnBG0o2F5/x7GKTyBKfUxriCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:36.191686Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.5991","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0d947f97a38761b44c8f5f008adee23625a0f51156d8daa4934315cf61624f95","sha256:4ce5516e4cf669e895ec7e5e3ad79651e8cf30a031f17f1a64fa4d9a73c54b6c"],"state_sha256":"9b74bc0ef468d623e9d8aa9cb81f792a6b6f2fe8e2ec2796fdd7b467e246ddc7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WOMD4XwG4wHeXMCLq+T4zrbCKY9z4RDkjU9gzesUtYBqT4Fnu07NT8uKfIAz05/86Vef6ru1UFzLLMZcO4PXCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T03:39:15.407222Z","bundle_sha256":"3f530f102ad33058ce1a48cb4f663435bbb07740462b08def92bb27b683c6294"}}