{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:52UJT6VQXD52HTJ5Q743KDAU53","short_pith_number":"pith:52UJT6VQ","schema_version":"1.0","canonical_sha256":"eea899fab0b8fba3cd3d87f9b50c14eec67e74d091fb23e768b45a164ae2e4bd","source":{"kind":"arxiv","id":"1001.0402","version":2},"attestation_state":"computed","paper":{"title":"Modular polynomials via isogeny volcanoes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Andrew V. Sutherland, Kristin Lauter, Reinier Broker","submitted_at":"2010-01-03T19:46:54Z","abstract_excerpt":"We present a new algorithm to compute the classical modular polynomial Phi_n in the rings Z[X,Y] and (Z/mZ)[X,Y], for a prime n and any positive integer m. Our approach uses the graph of n-isogenies to efficiently compute Phi_n mod p for many primes p of a suitable form, and then applies the Chinese Remainder Theorem (CRT). Under the Generalized Riemann Hypothesis (GRH), we achieve an expected running time of O(n^3 (log n)^3 log log n), and compute Phi_n mod m using O(n^2 (log n)^2 + n^2 log m) space. We have used the new algorithm to compute Phi_n with n over 5000, and Phi_n mod m with n over"},"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":"1001.0402","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2010-01-03T19:46:54Z","cross_cats_sorted":[],"title_canon_sha256":"774c105af36ff66bfe5328f7d423ed13534e74dba69dd515e4a39534575407f2","abstract_canon_sha256":"5826033c9b788f562bfd49e22fb26131f28410c5f15f927fc82f6c6c1c74b44b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:34:46.658195Z","signature_b64":"A9wDA4pS9UxduJuoVnzd0Ysidgo9NjGyvCzo5FJwBlpciirbgBaSu8GA23BBsxFnm9xQ8ytU6x5SSlhEwuudDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eea899fab0b8fba3cd3d87f9b50c14eec67e74d091fb23e768b45a164ae2e4bd","last_reissued_at":"2026-05-18T03:34:46.657544Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:34:46.657544Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Modular polynomials via isogeny volcanoes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Andrew V. Sutherland, Kristin Lauter, Reinier Broker","submitted_at":"2010-01-03T19:46:54Z","abstract_excerpt":"We present a new algorithm to compute the classical modular polynomial Phi_n in the rings Z[X,Y] and (Z/mZ)[X,Y], for a prime n and any positive integer m. Our approach uses the graph of n-isogenies to efficiently compute Phi_n mod p for many primes p of a suitable form, and then applies the Chinese Remainder Theorem (CRT). Under the Generalized Riemann Hypothesis (GRH), we achieve an expected running time of O(n^3 (log n)^3 log log n), and compute Phi_n mod m using O(n^2 (log n)^2 + n^2 log m) space. We have used the new algorithm to compute Phi_n with n over 5000, and Phi_n mod m with n over"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.0402","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":"1001.0402","created_at":"2026-05-18T03:34:46.657667+00:00"},{"alias_kind":"arxiv_version","alias_value":"1001.0402v2","created_at":"2026-05-18T03:34:46.657667+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.0402","created_at":"2026-05-18T03:34:46.657667+00:00"},{"alias_kind":"pith_short_12","alias_value":"52UJT6VQXD52","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_16","alias_value":"52UJT6VQXD52HTJ5","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_8","alias_value":"52UJT6VQ","created_at":"2026-05-18T12:26:04.259169+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/52UJT6VQXD52HTJ5Q743KDAU53","json":"https://pith.science/pith/52UJT6VQXD52HTJ5Q743KDAU53.json","graph_json":"https://pith.science/api/pith-number/52UJT6VQXD52HTJ5Q743KDAU53/graph.json","events_json":"https://pith.science/api/pith-number/52UJT6VQXD52HTJ5Q743KDAU53/events.json","paper":"https://pith.science/paper/52UJT6VQ"},"agent_actions":{"view_html":"https://pith.science/pith/52UJT6VQXD52HTJ5Q743KDAU53","download_json":"https://pith.science/pith/52UJT6VQXD52HTJ5Q743KDAU53.json","view_paper":"https://pith.science/paper/52UJT6VQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1001.0402&json=true","fetch_graph":"https://pith.science/api/pith-number/52UJT6VQXD52HTJ5Q743KDAU53/graph.json","fetch_events":"https://pith.science/api/pith-number/52UJT6VQXD52HTJ5Q743KDAU53/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/52UJT6VQXD52HTJ5Q743KDAU53/action/timestamp_anchor","attest_storage":"https://pith.science/pith/52UJT6VQXD52HTJ5Q743KDAU53/action/storage_attestation","attest_author":"https://pith.science/pith/52UJT6VQXD52HTJ5Q743KDAU53/action/author_attestation","sign_citation":"https://pith.science/pith/52UJT6VQXD52HTJ5Q743KDAU53/action/citation_signature","submit_replication":"https://pith.science/pith/52UJT6VQXD52HTJ5Q743KDAU53/action/replication_record"}},"created_at":"2026-05-18T03:34:46.657667+00:00","updated_at":"2026-05-18T03:34:46.657667+00:00"}