{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:QVOTMQYGMU2RONFWWPZ62FW2VC","short_pith_number":"pith:QVOTMQYG","schema_version":"1.0","canonical_sha256":"855d36430665351734b6b3f3ed16daa8b771894f47378514589055ee51b15e25","source":{"kind":"arxiv","id":"1106.3762","version":2},"attestation_state":"computed","paper":{"title":"Newton polygons and curve gonalities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.AG","authors_text":"Filip Cools, Wouter Castryck","submitted_at":"2011-06-19T16:54:46Z","abstract_excerpt":"We give a combinatorial upper bound for the gonality of a curve that is defined by a bivariate Laurent polynomial with given Newton polygon. We conjecture that this bound is generically attained, and provide proofs in a considerable number of special cases. One proof technique uses recent work of M. Baker on linear systems on graphs, by means of which we reduce our conjecture to a purely combinatorial statement."},"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":"1106.3762","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2011-06-19T16:54:46Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"b559152fb5008db5b1e7d07413b45d5c84b73d9d3ae7775b7d4191b96a474304","abstract_canon_sha256":"06642039a10df1b8048cf819fe228b587ae7ffb931276ea59e6075e8cf3548e5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:04:42.163521Z","signature_b64":"kF/9UxQQZh5qMPP5pDgni/+xzf7ebGYs2+L4yPZ36d9vtFoN6Gk/WBHdd5jbvD7bsEZ86vbkkEf2cnVn5OqpBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"855d36430665351734b6b3f3ed16daa8b771894f47378514589055ee51b15e25","last_reissued_at":"2026-05-18T04:04:42.162798Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:04:42.162798Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Newton polygons and curve gonalities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.AG","authors_text":"Filip Cools, Wouter Castryck","submitted_at":"2011-06-19T16:54:46Z","abstract_excerpt":"We give a combinatorial upper bound for the gonality of a curve that is defined by a bivariate Laurent polynomial with given Newton polygon. We conjecture that this bound is generically attained, and provide proofs in a considerable number of special cases. One proof technique uses recent work of M. Baker on linear systems on graphs, by means of which we reduce our conjecture to a purely combinatorial statement."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.3762","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":"1106.3762","created_at":"2026-05-18T04:04:42.162904+00:00"},{"alias_kind":"arxiv_version","alias_value":"1106.3762v2","created_at":"2026-05-18T04:04:42.162904+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.3762","created_at":"2026-05-18T04:04:42.162904+00:00"},{"alias_kind":"pith_short_12","alias_value":"QVOTMQYGMU2R","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_16","alias_value":"QVOTMQYGMU2RONFW","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_8","alias_value":"QVOTMQYG","created_at":"2026-05-18T12:26:39.201973+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/QVOTMQYGMU2RONFWWPZ62FW2VC","json":"https://pith.science/pith/QVOTMQYGMU2RONFWWPZ62FW2VC.json","graph_json":"https://pith.science/api/pith-number/QVOTMQYGMU2RONFWWPZ62FW2VC/graph.json","events_json":"https://pith.science/api/pith-number/QVOTMQYGMU2RONFWWPZ62FW2VC/events.json","paper":"https://pith.science/paper/QVOTMQYG"},"agent_actions":{"view_html":"https://pith.science/pith/QVOTMQYGMU2RONFWWPZ62FW2VC","download_json":"https://pith.science/pith/QVOTMQYGMU2RONFWWPZ62FW2VC.json","view_paper":"https://pith.science/paper/QVOTMQYG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1106.3762&json=true","fetch_graph":"https://pith.science/api/pith-number/QVOTMQYGMU2RONFWWPZ62FW2VC/graph.json","fetch_events":"https://pith.science/api/pith-number/QVOTMQYGMU2RONFWWPZ62FW2VC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QVOTMQYGMU2RONFWWPZ62FW2VC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QVOTMQYGMU2RONFWWPZ62FW2VC/action/storage_attestation","attest_author":"https://pith.science/pith/QVOTMQYGMU2RONFWWPZ62FW2VC/action/author_attestation","sign_citation":"https://pith.science/pith/QVOTMQYGMU2RONFWWPZ62FW2VC/action/citation_signature","submit_replication":"https://pith.science/pith/QVOTMQYGMU2RONFWWPZ62FW2VC/action/replication_record"}},"created_at":"2026-05-18T04:04:42.162904+00:00","updated_at":"2026-05-18T04:04:42.162904+00:00"}