{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:5DDJSFRPRLVQPGQ6T3MENCYN5L","short_pith_number":"pith:5DDJSFRP","schema_version":"1.0","canonical_sha256":"e8c699162f8aeb079a1e9ed8468b0deac660c59d9329833dd13cccde39278f08","source":{"kind":"arxiv","id":"1211.2681","version":3},"attestation_state":"computed","paper":{"title":"A combinatorial Li-Yau inequality and rational points on curves","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.AG","authors_text":"Fumiharu Kato, Gunther Cornelissen, Janne Kool","submitted_at":"2012-11-12T16:20:08Z","abstract_excerpt":"We present a method to control gonality of nonarchimedean curves based on graph theory. Let k denote a complete nonarchimedean valued field. We first prove a lower bound for the gonality of a curve over the algebraic closure of k in terms of the minimal degree of a class of graph maps, namely: one should minimize over all so-called finite harmonic graph morphisms to trees, that originate from any refinement of the dual graph of the stable model of the curve. Next comes our main result: we prove a lower bound for the degree of such a graph morphism in terms of the first eigenvalue of the Laplac"},"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":"1211.2681","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2012-11-12T16:20:08Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"3eb0d4f26831be1f285d9fff14c22c08263d542f8dc4af66cdacf360bbe4a57e","abstract_canon_sha256":"364a64aff36b818401019bf3e28922f5b1b8ea80440fd771d97019af4f496a74"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:01.610094Z","signature_b64":"PMhX3i6xgkEICWfTtsJTns3kMyYA3/lJ6H+sAoBMmmQvm6HSEOOFfcTbm6uAYKZfmL8zboittwDpYN6ehW3qDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e8c699162f8aeb079a1e9ed8468b0deac660c59d9329833dd13cccde39278f08","last_reissued_at":"2026-05-18T03:05:01.609570Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:01.609570Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A combinatorial Li-Yau inequality and rational points on curves","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.AG","authors_text":"Fumiharu Kato, Gunther Cornelissen, Janne Kool","submitted_at":"2012-11-12T16:20:08Z","abstract_excerpt":"We present a method to control gonality of nonarchimedean curves based on graph theory. Let k denote a complete nonarchimedean valued field. We first prove a lower bound for the gonality of a curve over the algebraic closure of k in terms of the minimal degree of a class of graph maps, namely: one should minimize over all so-called finite harmonic graph morphisms to trees, that originate from any refinement of the dual graph of the stable model of the curve. Next comes our main result: we prove a lower bound for the degree of such a graph morphism in terms of the first eigenvalue of the Laplac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.2681","kind":"arxiv","version":3},"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":"1211.2681","created_at":"2026-05-18T03:05:01.609646+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.2681v3","created_at":"2026-05-18T03:05:01.609646+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.2681","created_at":"2026-05-18T03:05:01.609646+00:00"},{"alias_kind":"pith_short_12","alias_value":"5DDJSFRPRLVQ","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"5DDJSFRPRLVQPGQ6","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"5DDJSFRP","created_at":"2026-05-18T12:26:53.410803+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/5DDJSFRPRLVQPGQ6T3MENCYN5L","json":"https://pith.science/pith/5DDJSFRPRLVQPGQ6T3MENCYN5L.json","graph_json":"https://pith.science/api/pith-number/5DDJSFRPRLVQPGQ6T3MENCYN5L/graph.json","events_json":"https://pith.science/api/pith-number/5DDJSFRPRLVQPGQ6T3MENCYN5L/events.json","paper":"https://pith.science/paper/5DDJSFRP"},"agent_actions":{"view_html":"https://pith.science/pith/5DDJSFRPRLVQPGQ6T3MENCYN5L","download_json":"https://pith.science/pith/5DDJSFRPRLVQPGQ6T3MENCYN5L.json","view_paper":"https://pith.science/paper/5DDJSFRP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.2681&json=true","fetch_graph":"https://pith.science/api/pith-number/5DDJSFRPRLVQPGQ6T3MENCYN5L/graph.json","fetch_events":"https://pith.science/api/pith-number/5DDJSFRPRLVQPGQ6T3MENCYN5L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5DDJSFRPRLVQPGQ6T3MENCYN5L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5DDJSFRPRLVQPGQ6T3MENCYN5L/action/storage_attestation","attest_author":"https://pith.science/pith/5DDJSFRPRLVQPGQ6T3MENCYN5L/action/author_attestation","sign_citation":"https://pith.science/pith/5DDJSFRPRLVQPGQ6T3MENCYN5L/action/citation_signature","submit_replication":"https://pith.science/pith/5DDJSFRPRLVQPGQ6T3MENCYN5L/action/replication_record"}},"created_at":"2026-05-18T03:05:01.609646+00:00","updated_at":"2026-05-18T03:05:01.609646+00:00"}