{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:QC2F7HQXIIED67INVTTG4TKHY2","short_pith_number":"pith:QC2F7HQX","schema_version":"1.0","canonical_sha256":"80b45f9e1742083f7d0dace66e4d47c688cda1f812b95b3db545af2716564e85","source":{"kind":"arxiv","id":"0903.2785","version":4},"attestation_state":"computed","paper":{"title":"Computing Hilbert class polynomials with the Chinese Remainder Theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Andrew V. Sutherland","submitted_at":"2009-03-16T15:53:27Z","abstract_excerpt":"We present a space-efficient algorithm to compute the Hilbert class polynomial H_D(X) modulo a positive integer P, based on an explicit form of the Chinese Remainder Theorem. Under the Generalized Riemann Hypothesis, the algorithm uses O(|D|^(1/2+o(1))log P) space and has an expected running time of O(|D|^(1+o(1)). We describe practical optimizations that allow us to handle larger discriminants than other methods, with |D| as large as 10^13 and h(D) up to 10^6. We apply these results to construct pairing-friendly elliptic curves of prime order, using the CM method."},"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":"0903.2785","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2009-03-16T15:53:27Z","cross_cats_sorted":[],"title_canon_sha256":"13018be96048173a5437e75c6bb0b124cf6453929464c7a34dda54809c8e0c7d","abstract_canon_sha256":"4b7f9a4648f9c80df8ad4d72c88d0d2946d806e10fd7514a91fcacd80d8947c0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:06:33.070402Z","signature_b64":"ypEJ/LMyAQenxHKc6i1dp8B3Z6t2S+nnYitGgsB4oZanpPZJ5qC8smDCXO6/3GiLN2lAtvYB2ikfLEofGdtJCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80b45f9e1742083f7d0dace66e4d47c688cda1f812b95b3db545af2716564e85","last_reissued_at":"2026-05-18T03:06:33.069613Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:06:33.069613Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing Hilbert class polynomials with the Chinese Remainder Theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Andrew V. Sutherland","submitted_at":"2009-03-16T15:53:27Z","abstract_excerpt":"We present a space-efficient algorithm to compute the Hilbert class polynomial H_D(X) modulo a positive integer P, based on an explicit form of the Chinese Remainder Theorem. Under the Generalized Riemann Hypothesis, the algorithm uses O(|D|^(1/2+o(1))log P) space and has an expected running time of O(|D|^(1+o(1)). We describe practical optimizations that allow us to handle larger discriminants than other methods, with |D| as large as 10^13 and h(D) up to 10^6. We apply these results to construct pairing-friendly elliptic curves of prime order, using the CM method."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0903.2785","kind":"arxiv","version":4},"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":"0903.2785","created_at":"2026-05-18T03:06:33.069738+00:00"},{"alias_kind":"arxiv_version","alias_value":"0903.2785v4","created_at":"2026-05-18T03:06:33.069738+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0903.2785","created_at":"2026-05-18T03:06:33.069738+00:00"},{"alias_kind":"pith_short_12","alias_value":"QC2F7HQXIIED","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_16","alias_value":"QC2F7HQXIIED67IN","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_8","alias_value":"QC2F7HQX","created_at":"2026-05-18T12:26:01.383474+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/QC2F7HQXIIED67INVTTG4TKHY2","json":"https://pith.science/pith/QC2F7HQXIIED67INVTTG4TKHY2.json","graph_json":"https://pith.science/api/pith-number/QC2F7HQXIIED67INVTTG4TKHY2/graph.json","events_json":"https://pith.science/api/pith-number/QC2F7HQXIIED67INVTTG4TKHY2/events.json","paper":"https://pith.science/paper/QC2F7HQX"},"agent_actions":{"view_html":"https://pith.science/pith/QC2F7HQXIIED67INVTTG4TKHY2","download_json":"https://pith.science/pith/QC2F7HQXIIED67INVTTG4TKHY2.json","view_paper":"https://pith.science/paper/QC2F7HQX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0903.2785&json=true","fetch_graph":"https://pith.science/api/pith-number/QC2F7HQXIIED67INVTTG4TKHY2/graph.json","fetch_events":"https://pith.science/api/pith-number/QC2F7HQXIIED67INVTTG4TKHY2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QC2F7HQXIIED67INVTTG4TKHY2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QC2F7HQXIIED67INVTTG4TKHY2/action/storage_attestation","attest_author":"https://pith.science/pith/QC2F7HQXIIED67INVTTG4TKHY2/action/author_attestation","sign_citation":"https://pith.science/pith/QC2F7HQXIIED67INVTTG4TKHY2/action/citation_signature","submit_replication":"https://pith.science/pith/QC2F7HQXIIED67INVTTG4TKHY2/action/replication_record"}},"created_at":"2026-05-18T03:06:33.069738+00:00","updated_at":"2026-05-18T03:06:33.069738+00:00"}