{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:D7PVDC6KLZCQPEMUPMDIHVFISA","short_pith_number":"pith:D7PVDC6K","schema_version":"1.0","canonical_sha256":"1fdf518bca5e450791947b0683d4a89014a33348992f231e389bf3049b665de3","source":{"kind":"arxiv","id":"1606.06412","version":2},"attestation_state":"computed","paper":{"title":"Sparse graphs of high gonality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kevin Hendrey","submitted_at":"2016-06-21T03:57:54Z","abstract_excerpt":"By considering graphs as discrete analogues of Riemann surfaces, Baker and Norine (Adv. Math. 2007) developed a concept of linear systems of divisors for graphs. Building on this idea, a concept of gonality for graphs has been defined and has generated much recent interest. We show that there are connected graphs of treewidth 2 of arbitrarily high gonality. We also show that there exist pairs of connected graphs $\\{G,H\\}$ such that $H\\subseteq G$ and $H$ has strictly lower gonality than $G$. These results resolve three open problems posed in a recent survey by Norine (Surveys in Combinatorics "},"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":"1606.06412","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-21T03:57:54Z","cross_cats_sorted":[],"title_canon_sha256":"53418b2f30ea9c0149c9c3ce59a10f9d156549e20970274753579dace7a9cc1f","abstract_canon_sha256":"3236b38b4bc977ff22fa3de399a13e359e40d4ad4de29620ddc01c55c63b96f4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:17.080498Z","signature_b64":"xAvYhDsvWgZ1BNHBOHFBUQkNFP4WYfHJCwe5dL1mwRd6uUV+olQZe0FugNy2EeuGO/+XN4QbkRveV5mZOe7VBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1fdf518bca5e450791947b0683d4a89014a33348992f231e389bf3049b665de3","last_reissued_at":"2026-05-18T01:11:17.079897Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:17.079897Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparse graphs of high gonality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kevin Hendrey","submitted_at":"2016-06-21T03:57:54Z","abstract_excerpt":"By considering graphs as discrete analogues of Riemann surfaces, Baker and Norine (Adv. Math. 2007) developed a concept of linear systems of divisors for graphs. Building on this idea, a concept of gonality for graphs has been defined and has generated much recent interest. We show that there are connected graphs of treewidth 2 of arbitrarily high gonality. We also show that there exist pairs of connected graphs $\\{G,H\\}$ such that $H\\subseteq G$ and $H$ has strictly lower gonality than $G$. These results resolve three open problems posed in a recent survey by Norine (Surveys in Combinatorics "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.06412","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":"1606.06412","created_at":"2026-05-18T01:11:17.080003+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.06412v2","created_at":"2026-05-18T01:11:17.080003+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.06412","created_at":"2026-05-18T01:11:17.080003+00:00"},{"alias_kind":"pith_short_12","alias_value":"D7PVDC6KLZCQ","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"D7PVDC6KLZCQPEMU","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"D7PVDC6K","created_at":"2026-05-18T12:30:09.641336+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/D7PVDC6KLZCQPEMUPMDIHVFISA","json":"https://pith.science/pith/D7PVDC6KLZCQPEMUPMDIHVFISA.json","graph_json":"https://pith.science/api/pith-number/D7PVDC6KLZCQPEMUPMDIHVFISA/graph.json","events_json":"https://pith.science/api/pith-number/D7PVDC6KLZCQPEMUPMDIHVFISA/events.json","paper":"https://pith.science/paper/D7PVDC6K"},"agent_actions":{"view_html":"https://pith.science/pith/D7PVDC6KLZCQPEMUPMDIHVFISA","download_json":"https://pith.science/pith/D7PVDC6KLZCQPEMUPMDIHVFISA.json","view_paper":"https://pith.science/paper/D7PVDC6K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.06412&json=true","fetch_graph":"https://pith.science/api/pith-number/D7PVDC6KLZCQPEMUPMDIHVFISA/graph.json","fetch_events":"https://pith.science/api/pith-number/D7PVDC6KLZCQPEMUPMDIHVFISA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D7PVDC6KLZCQPEMUPMDIHVFISA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D7PVDC6KLZCQPEMUPMDIHVFISA/action/storage_attestation","attest_author":"https://pith.science/pith/D7PVDC6KLZCQPEMUPMDIHVFISA/action/author_attestation","sign_citation":"https://pith.science/pith/D7PVDC6KLZCQPEMUPMDIHVFISA/action/citation_signature","submit_replication":"https://pith.science/pith/D7PVDC6KLZCQPEMUPMDIHVFISA/action/replication_record"}},"created_at":"2026-05-18T01:11:17.080003+00:00","updated_at":"2026-05-18T01:11:17.080003+00:00"}