{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:TOAESOQ43HTDF7MFPYE7OFWFLM","short_pith_number":"pith:TOAESOQ4","canonical_record":{"source":{"id":"1504.06713","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-04-25T11:28:24Z","cross_cats_sorted":[],"title_canon_sha256":"39e1d58b34d8bb26ed5eba93d2e1760cfe321b9a2a27cee0e57eed374ad1f944","abstract_canon_sha256":"aa9fba4c361bee7603d8b2695c6d39664b61970bca93c985c932b345ed19083d"},"schema_version":"1.0"},"canonical_sha256":"9b80493a1cd9e632fd857e09f716c55b275f56f485f2c6bb0e9f8997d4c3fd8f","source":{"kind":"arxiv","id":"1504.06713","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.06713","created_at":"2026-05-17T23:48:41Z"},{"alias_kind":"arxiv_version","alias_value":"1504.06713v2","created_at":"2026-05-17T23:48:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.06713","created_at":"2026-05-17T23:48:41Z"},{"alias_kind":"pith_short_12","alias_value":"TOAESOQ43HTD","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"TOAESOQ43HTDF7MF","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"TOAESOQ4","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:TOAESOQ43HTDF7MFPYE7OFWFLM","target":"record","payload":{"canonical_record":{"source":{"id":"1504.06713","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-04-25T11:28:24Z","cross_cats_sorted":[],"title_canon_sha256":"39e1d58b34d8bb26ed5eba93d2e1760cfe321b9a2a27cee0e57eed374ad1f944","abstract_canon_sha256":"aa9fba4c361bee7603d8b2695c6d39664b61970bca93c985c932b345ed19083d"},"schema_version":"1.0"},"canonical_sha256":"9b80493a1cd9e632fd857e09f716c55b275f56f485f2c6bb0e9f8997d4c3fd8f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:41.163907Z","signature_b64":"T5QTINT6SZs40JrYYriztX6q2Gq0vfUBcAZ5EOXFnzzt46ykcjyeVNGXZHx/IL13qyCK3IUTXbsrx5ae4e1VDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b80493a1cd9e632fd857e09f716c55b275f56f485f2c6bb0e9f8997d4c3fd8f","last_reissued_at":"2026-05-17T23:48:41.163467Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:41.163467Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.06713","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:48:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bYEH3H183hlpXy+/SWMJNSY6uEWDzBBpqmcX92ES2MTqY/5jUG0VjCdUF+JNGIrYwKgnOYlvGq7/1N092KRCAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T18:03:37.985974Z"},"content_sha256":"8d03edfd165be1a2c320d67e03efe584d9232a270760a635296c541b74c29650","schema_version":"1.0","event_id":"sha256:8d03edfd165be1a2c320d67e03efe584d9232a270760a635296c541b74c29650"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:TOAESOQ43HTDF7MFPYE7OFWFLM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computing graph gonality is hard","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dion Gijswijt, Harry Smit, Marieke van der Wegen","submitted_at":"2015-04-25T11:28:24Z","abstract_excerpt":"There are several notions of gonality for graphs. The divisorial gonality dgon(G) of a graph G is the smallest degree of a divisor of positive rank in the sense of Baker-Norine. The stable gonality sgon(G) of a graph G is the minimum degree of a finite harmonic morphism from a refinement of G to a tree, as defined by Cornelissen, Kato and Kool. We show that computing dgon(G) and sgon(G) are NP-hard by a reduction from the maximum independent set problem and the vertex cover problem, respectively. Both constructions show that computing gonality is moreover APX-hard."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.06713","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:48:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yPTnAWzr9bp/DEprbW6BYTE8ME8JzyLIKxgOZL913IWxuG1c5N+OD1UEV2v/fZP9OpZnZdrYnWz5zuBW6GRWBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T18:03:37.986591Z"},"content_sha256":"720e58b2330f0eac4185b1879c7126c65ee9f1aa217d8c1c78c9a109838d5250","schema_version":"1.0","event_id":"sha256:720e58b2330f0eac4185b1879c7126c65ee9f1aa217d8c1c78c9a109838d5250"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TOAESOQ43HTDF7MFPYE7OFWFLM/bundle.json","state_url":"https://pith.science/pith/TOAESOQ43HTDF7MFPYE7OFWFLM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TOAESOQ43HTDF7MFPYE7OFWFLM/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T18:03:37Z","links":{"resolver":"https://pith.science/pith/TOAESOQ43HTDF7MFPYE7OFWFLM","bundle":"https://pith.science/pith/TOAESOQ43HTDF7MFPYE7OFWFLM/bundle.json","state":"https://pith.science/pith/TOAESOQ43HTDF7MFPYE7OFWFLM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TOAESOQ43HTDF7MFPYE7OFWFLM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:TOAESOQ43HTDF7MFPYE7OFWFLM","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"aa9fba4c361bee7603d8b2695c6d39664b61970bca93c985c932b345ed19083d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-04-25T11:28:24Z","title_canon_sha256":"39e1d58b34d8bb26ed5eba93d2e1760cfe321b9a2a27cee0e57eed374ad1f944"},"schema_version":"1.0","source":{"id":"1504.06713","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.06713","created_at":"2026-05-17T23:48:41Z"},{"alias_kind":"arxiv_version","alias_value":"1504.06713v2","created_at":"2026-05-17T23:48:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.06713","created_at":"2026-05-17T23:48:41Z"},{"alias_kind":"pith_short_12","alias_value":"TOAESOQ43HTD","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"TOAESOQ43HTDF7MF","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"TOAESOQ4","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:720e58b2330f0eac4185b1879c7126c65ee9f1aa217d8c1c78c9a109838d5250","target":"graph","created_at":"2026-05-17T23:48:41Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"There are several notions of gonality for graphs. The divisorial gonality dgon(G) of a graph G is the smallest degree of a divisor of positive rank in the sense of Baker-Norine. The stable gonality sgon(G) of a graph G is the minimum degree of a finite harmonic morphism from a refinement of G to a tree, as defined by Cornelissen, Kato and Kool. We show that computing dgon(G) and sgon(G) are NP-hard by a reduction from the maximum independent set problem and the vertex cover problem, respectively. Both constructions show that computing gonality is moreover APX-hard.","authors_text":"Dion Gijswijt, Harry Smit, Marieke van der Wegen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-04-25T11:28:24Z","title":"Computing graph gonality is hard"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.06713","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:8d03edfd165be1a2c320d67e03efe584d9232a270760a635296c541b74c29650","target":"record","created_at":"2026-05-17T23:48:41Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"aa9fba4c361bee7603d8b2695c6d39664b61970bca93c985c932b345ed19083d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-04-25T11:28:24Z","title_canon_sha256":"39e1d58b34d8bb26ed5eba93d2e1760cfe321b9a2a27cee0e57eed374ad1f944"},"schema_version":"1.0","source":{"id":"1504.06713","kind":"arxiv","version":2}},"canonical_sha256":"9b80493a1cd9e632fd857e09f716c55b275f56f485f2c6bb0e9f8997d4c3fd8f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9b80493a1cd9e632fd857e09f716c55b275f56f485f2c6bb0e9f8997d4c3fd8f","first_computed_at":"2026-05-17T23:48:41.163467Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:41.163467Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"T5QTINT6SZs40JrYYriztX6q2Gq0vfUBcAZ5EOXFnzzt46ykcjyeVNGXZHx/IL13qyCK3IUTXbsrx5ae4e1VDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:41.163907Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.06713","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8d03edfd165be1a2c320d67e03efe584d9232a270760a635296c541b74c29650","sha256:720e58b2330f0eac4185b1879c7126c65ee9f1aa217d8c1c78c9a109838d5250"],"state_sha256":"2f5fe78d754e03971bfd6c13245c0da795ecfd35ca4de9a62f6b68d21c72a08c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WR5zPls+5tOyC+zJTGr+yVY3ScQNSiRi6hYIcJGC+tK2HMl4bXWZyrhqI1WGlSKgcr6CtZUFC6MO9ppzl2tjAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T18:03:37.989418Z","bundle_sha256":"1a731f91c5923ad39da23e1742cc1312a5501558daa4b93b899c64480dc747dc"}}