{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2001:MDXEBIZOJGRTFYP5M6CITGZ2JN","short_pith_number":"pith:MDXEBIZO","schema_version":"1.0","canonical_sha256":"60ee40a32e49a332e1fd6784899b3a4b714213264e8b9e7ff1a18ebaddadd131","source":{"kind":"arxiv","id":"math/0103107","version":1},"attestation_state":"computed","paper":{"title":"Explicit modular towers","license":"","headline":"","cross_cats":["cs.IT","math.AG","math.IT"],"primary_cat":"math.NT","authors_text":"Noam D. Elkies","submitted_at":"2001-03-16T20:15:01Z","abstract_excerpt":"We give a general recipe for explicitly constructing asymptotically optimal towers of modular curves such as {X_0(l^n): n=1,2,3,...}. We illustrate the method by giving equations for eight towers with various geometric features. We conclude by observing that such towers are all of a specific recursive form, and speculate that perhaps every tower of this form that attains the Drinfeld-Vladut bound is modular."},"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":"math/0103107","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.NT","submitted_at":"2001-03-16T20:15:01Z","cross_cats_sorted":["cs.IT","math.AG","math.IT"],"title_canon_sha256":"224c715b3aaaf5abf199d5ced5cdde1455af3be2a14104990f52a9847ea6f9b2","abstract_canon_sha256":"6376c263516a20827e89d0d6b4e10a82cd2c4f6268eeb94b6a4e69ddc44516c8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:03:02.120630Z","signature_b64":"wBRd+bVRG1wPLckzuJWKWzs+sLyhhPH0QYiLUySoAzxnNe/Vv3bjmk3ZhIhWzi+GEn5772YQThUiwJ9BPacACg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60ee40a32e49a332e1fd6784899b3a4b714213264e8b9e7ff1a18ebaddadd131","last_reissued_at":"2026-07-04T15:03:02.120274Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:03:02.120274Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Explicit modular towers","license":"","headline":"","cross_cats":["cs.IT","math.AG","math.IT"],"primary_cat":"math.NT","authors_text":"Noam D. Elkies","submitted_at":"2001-03-16T20:15:01Z","abstract_excerpt":"We give a general recipe for explicitly constructing asymptotically optimal towers of modular curves such as {X_0(l^n): n=1,2,3,...}. We illustrate the method by giving equations for eight towers with various geometric features. We conclude by observing that such towers are all of a specific recursive form, and speculate that perhaps every tower of this form that attains the Drinfeld-Vladut bound is modular."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0103107","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/math/0103107/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"math/0103107","created_at":"2026-07-04T15:03:02.120341+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0103107v1","created_at":"2026-07-04T15:03:02.120341+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0103107","created_at":"2026-07-04T15:03:02.120341+00:00"},{"alias_kind":"pith_short_12","alias_value":"MDXEBIZOJGRT","created_at":"2026-07-04T15:03:02.120341+00:00"},{"alias_kind":"pith_short_16","alias_value":"MDXEBIZOJGRTFYP5","created_at":"2026-07-04T15:03:02.120341+00:00"},{"alias_kind":"pith_short_8","alias_value":"MDXEBIZO","created_at":"2026-07-04T15:03:02.120341+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/MDXEBIZOJGRTFYP5M6CITGZ2JN","json":"https://pith.science/pith/MDXEBIZOJGRTFYP5M6CITGZ2JN.json","graph_json":"https://pith.science/api/pith-number/MDXEBIZOJGRTFYP5M6CITGZ2JN/graph.json","events_json":"https://pith.science/api/pith-number/MDXEBIZOJGRTFYP5M6CITGZ2JN/events.json","paper":"https://pith.science/paper/MDXEBIZO"},"agent_actions":{"view_html":"https://pith.science/pith/MDXEBIZOJGRTFYP5M6CITGZ2JN","download_json":"https://pith.science/pith/MDXEBIZOJGRTFYP5M6CITGZ2JN.json","view_paper":"https://pith.science/paper/MDXEBIZO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0103107&json=true","fetch_graph":"https://pith.science/api/pith-number/MDXEBIZOJGRTFYP5M6CITGZ2JN/graph.json","fetch_events":"https://pith.science/api/pith-number/MDXEBIZOJGRTFYP5M6CITGZ2JN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MDXEBIZOJGRTFYP5M6CITGZ2JN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MDXEBIZOJGRTFYP5M6CITGZ2JN/action/storage_attestation","attest_author":"https://pith.science/pith/MDXEBIZOJGRTFYP5M6CITGZ2JN/action/author_attestation","sign_citation":"https://pith.science/pith/MDXEBIZOJGRTFYP5M6CITGZ2JN/action/citation_signature","submit_replication":"https://pith.science/pith/MDXEBIZOJGRTFYP5M6CITGZ2JN/action/replication_record"}},"created_at":"2026-07-04T15:03:02.120341+00:00","updated_at":"2026-07-04T15:03:02.120341+00:00"}