{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:2TWMWTORWP3IJHSAIJFB5BBSIG","short_pith_number":"pith:2TWMWTOR","schema_version":"1.0","canonical_sha256":"d4eccb4dd1b3f6849e40424a1e843241b83ce4fb3ea758ee25786d5b9b17c6af","source":{"kind":"arxiv","id":"1808.06921","version":1},"attestation_state":"computed","paper":{"title":"Stable divisorial gonality is in NP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.CC","authors_text":"Hans L. Bodlaender, Marieke van der Wegen, Tom C. van der Zanden","submitted_at":"2018-08-21T14:29:22Z","abstract_excerpt":"Divisorial gonality and stable divisorial gonality are graph parameters, which have an origin in algebraic geometry. Divisorial gonality of a connected graph $G$ can be defined with help of a chip firing game on $G$. The stable divisorial gonality of $G$ is the minimum divisorial gonality over all subdivisions of edges of $G$.\n  In this paper we prove that deciding whether a given connected graph has stable divisorial gonality at most a given integer $k$ belongs to the class NP. Combined with the result that (stable) divisorial gonality is NP-hard by Gijswijt, we obtain that stable divisorial "},"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":"1808.06921","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-08-21T14:29:22Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"e3b36a50b4c48cdc1dc95fbc4206e6e325f7796a27e556ac492dfc614cadd736","abstract_canon_sha256":"0c62d71dde82bb1cd648edf6a8a6503ff8294870cca916ac4b0e16c6c67513dc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:38.661445Z","signature_b64":"YVUBtlkY3HBfYCD2i0fWRDhZp9I/snZL+ZYxfiHI9MYjfUTOTETMMxQLaI3kKdPPnLPG7Hxtm5QDNh0zJWyiCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4eccb4dd1b3f6849e40424a1e843241b83ce4fb3ea758ee25786d5b9b17c6af","last_reissued_at":"2026-05-18T00:07:38.660748Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:38.660748Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stable divisorial gonality is in NP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.CC","authors_text":"Hans L. Bodlaender, Marieke van der Wegen, Tom C. van der Zanden","submitted_at":"2018-08-21T14:29:22Z","abstract_excerpt":"Divisorial gonality and stable divisorial gonality are graph parameters, which have an origin in algebraic geometry. Divisorial gonality of a connected graph $G$ can be defined with help of a chip firing game on $G$. The stable divisorial gonality of $G$ is the minimum divisorial gonality over all subdivisions of edges of $G$.\n  In this paper we prove that deciding whether a given connected graph has stable divisorial gonality at most a given integer $k$ belongs to the class NP. Combined with the result that (stable) divisorial gonality is NP-hard by Gijswijt, we obtain that stable divisorial "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.06921","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":""},"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":"1808.06921","created_at":"2026-05-18T00:07:38.660852+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.06921v1","created_at":"2026-05-18T00:07:38.660852+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.06921","created_at":"2026-05-18T00:07:38.660852+00:00"},{"alias_kind":"pith_short_12","alias_value":"2TWMWTORWP3I","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"2TWMWTORWP3IJHSA","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"2TWMWTOR","created_at":"2026-05-18T12:32:02.567920+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/2TWMWTORWP3IJHSAIJFB5BBSIG","json":"https://pith.science/pith/2TWMWTORWP3IJHSAIJFB5BBSIG.json","graph_json":"https://pith.science/api/pith-number/2TWMWTORWP3IJHSAIJFB5BBSIG/graph.json","events_json":"https://pith.science/api/pith-number/2TWMWTORWP3IJHSAIJFB5BBSIG/events.json","paper":"https://pith.science/paper/2TWMWTOR"},"agent_actions":{"view_html":"https://pith.science/pith/2TWMWTORWP3IJHSAIJFB5BBSIG","download_json":"https://pith.science/pith/2TWMWTORWP3IJHSAIJFB5BBSIG.json","view_paper":"https://pith.science/paper/2TWMWTOR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.06921&json=true","fetch_graph":"https://pith.science/api/pith-number/2TWMWTORWP3IJHSAIJFB5BBSIG/graph.json","fetch_events":"https://pith.science/api/pith-number/2TWMWTORWP3IJHSAIJFB5BBSIG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2TWMWTORWP3IJHSAIJFB5BBSIG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2TWMWTORWP3IJHSAIJFB5BBSIG/action/storage_attestation","attest_author":"https://pith.science/pith/2TWMWTORWP3IJHSAIJFB5BBSIG/action/author_attestation","sign_citation":"https://pith.science/pith/2TWMWTORWP3IJHSAIJFB5BBSIG/action/citation_signature","submit_replication":"https://pith.science/pith/2TWMWTORWP3IJHSAIJFB5BBSIG/action/replication_record"}},"created_at":"2026-05-18T00:07:38.660852+00:00","updated_at":"2026-05-18T00:07:38.660852+00:00"}