{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:GV2HLZ7PXELTRFE7RZG3NOSWIK","short_pith_number":"pith:GV2HLZ7P","schema_version":"1.0","canonical_sha256":"357475e7efb91738949f8e4db6ba5642a661c5cf6796f33a89433d726f89f045","source":{"kind":"arxiv","id":"1212.3465","version":2},"attestation_state":"computed","paper":{"title":"Recursive towers of curves over finite fields using graph theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG"],"primary_cat":"math.NT","authors_text":"Emmanuel Hallouin, Marc Perret","submitted_at":"2012-12-14T13:22:03Z","abstract_excerpt":"We give a new way to study recursive towers of curves over a finite field, defined from a bottom curve $\\Cun$ and a correspondence $\\Cdeux$ on $\\Cun$.In particular, we study their asymptotic behavior. A close examination of singularities leads to a necessary condition for a tower to be asymptotically good. Then, spectral theory on a directed graph and considerations on the class of $\\Cdeux$ in $\\NS (\\Cun \\times \\Cun)$ lead to the fact that, under some mild assumptions, a recursive tower which does not reach Drinfeld-Vladut bound cannot be optimal in Tsfasmann-Vladut sense. Results are applied "},"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":"1212.3465","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2012-12-14T13:22:03Z","cross_cats_sorted":["math.AG"],"title_canon_sha256":"fb47d116ad695019a3bd09429d006dfababd0bc31262706adf04ee9d9bb78792","abstract_canon_sha256":"36376eee5a8f4ca5439d06a84bca19464e13bed21273345eed0534a6ced4a80b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:56:11.725001Z","signature_b64":"igkms28LI8a3nMjfF920ri55h4HNTZCp6sVZmiKWd/N+IbwdY/f4FoZ5zf16VEYXLpDiTCIlzPJVofVnFOZWAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"357475e7efb91738949f8e4db6ba5642a661c5cf6796f33a89433d726f89f045","last_reissued_at":"2026-05-18T02:56:11.724588Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:56:11.724588Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Recursive towers of curves over finite fields using graph theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG"],"primary_cat":"math.NT","authors_text":"Emmanuel Hallouin, Marc Perret","submitted_at":"2012-12-14T13:22:03Z","abstract_excerpt":"We give a new way to study recursive towers of curves over a finite field, defined from a bottom curve $\\Cun$ and a correspondence $\\Cdeux$ on $\\Cun$.In particular, we study their asymptotic behavior. A close examination of singularities leads to a necessary condition for a tower to be asymptotically good. Then, spectral theory on a directed graph and considerations on the class of $\\Cdeux$ in $\\NS (\\Cun \\times \\Cun)$ lead to the fact that, under some mild assumptions, a recursive tower which does not reach Drinfeld-Vladut bound cannot be optimal in Tsfasmann-Vladut sense. Results are applied "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.3465","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":"1212.3465","created_at":"2026-05-18T02:56:11.724655+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.3465v2","created_at":"2026-05-18T02:56:11.724655+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.3465","created_at":"2026-05-18T02:56:11.724655+00:00"},{"alias_kind":"pith_short_12","alias_value":"GV2HLZ7PXELT","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_16","alias_value":"GV2HLZ7PXELTRFE7","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_8","alias_value":"GV2HLZ7P","created_at":"2026-05-18T12:27:06.952714+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/GV2HLZ7PXELTRFE7RZG3NOSWIK","json":"https://pith.science/pith/GV2HLZ7PXELTRFE7RZG3NOSWIK.json","graph_json":"https://pith.science/api/pith-number/GV2HLZ7PXELTRFE7RZG3NOSWIK/graph.json","events_json":"https://pith.science/api/pith-number/GV2HLZ7PXELTRFE7RZG3NOSWIK/events.json","paper":"https://pith.science/paper/GV2HLZ7P"},"agent_actions":{"view_html":"https://pith.science/pith/GV2HLZ7PXELTRFE7RZG3NOSWIK","download_json":"https://pith.science/pith/GV2HLZ7PXELTRFE7RZG3NOSWIK.json","view_paper":"https://pith.science/paper/GV2HLZ7P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.3465&json=true","fetch_graph":"https://pith.science/api/pith-number/GV2HLZ7PXELTRFE7RZG3NOSWIK/graph.json","fetch_events":"https://pith.science/api/pith-number/GV2HLZ7PXELTRFE7RZG3NOSWIK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GV2HLZ7PXELTRFE7RZG3NOSWIK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GV2HLZ7PXELTRFE7RZG3NOSWIK/action/storage_attestation","attest_author":"https://pith.science/pith/GV2HLZ7PXELTRFE7RZG3NOSWIK/action/author_attestation","sign_citation":"https://pith.science/pith/GV2HLZ7PXELTRFE7RZG3NOSWIK/action/citation_signature","submit_replication":"https://pith.science/pith/GV2HLZ7PXELTRFE7RZG3NOSWIK/action/replication_record"}},"created_at":"2026-05-18T02:56:11.724655+00:00","updated_at":"2026-05-18T02:56:11.724655+00:00"}