{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:B2KDGEPST4V2GKHZAHPG4YSDPS","short_pith_number":"pith:B2KDGEPS","canonical_record":{"source":{"id":"1407.7055","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-25T20:50:30Z","cross_cats_sorted":[],"title_canon_sha256":"7f2624988ab9fe1930429f310df5d2b0d4fdb8ccb2ac68f8386ab2abcbce8edb","abstract_canon_sha256":"5dc3c30ed29777264a400d2338380068c9a8dab1516dae7e2e29c3767a9f9e34"},"schema_version":"1.0"},"canonical_sha256":"0e943311f29f2ba328f901de6e62437c938309fe43834a6169ddc227db4ce9be","source":{"kind":"arxiv","id":"1407.7055","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.7055","created_at":"2026-07-05T03:44:48Z"},{"alias_kind":"arxiv_version","alias_value":"1407.7055v2","created_at":"2026-07-05T03:44:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.7055","created_at":"2026-07-05T03:44:48Z"},{"alias_kind":"pith_short_12","alias_value":"B2KDGEPST4V2","created_at":"2026-07-05T03:44:48Z"},{"alias_kind":"pith_short_16","alias_value":"B2KDGEPST4V2GKHZ","created_at":"2026-07-05T03:44:48Z"},{"alias_kind":"pith_short_8","alias_value":"B2KDGEPS","created_at":"2026-07-05T03:44:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:B2KDGEPST4V2GKHZAHPG4YSDPS","target":"record","payload":{"canonical_record":{"source":{"id":"1407.7055","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-25T20:50:30Z","cross_cats_sorted":[],"title_canon_sha256":"7f2624988ab9fe1930429f310df5d2b0d4fdb8ccb2ac68f8386ab2abcbce8edb","abstract_canon_sha256":"5dc3c30ed29777264a400d2338380068c9a8dab1516dae7e2e29c3767a9f9e34"},"schema_version":"1.0"},"canonical_sha256":"0e943311f29f2ba328f901de6e62437c938309fe43834a6169ddc227db4ce9be","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:44:48.084169Z","signature_b64":"VZChLCNrp+dY2EQzkYzgu63tOROrPI8z0IIUSxzVTaXjEvVwvE2eyoP3a6aRMmQqEbb6AbJ/+S+jEaNiv6fvBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e943311f29f2ba328f901de6e62437c938309fe43834a6169ddc227db4ce9be","last_reissued_at":"2026-07-05T03:44:48.083643Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:44:48.083643Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.7055","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-07-05T03:44:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IuVJ/Aka7VX8WGXB/cNDXVb5DHxGQv+m1M0/7u4Pt3IqjCQB/hbWeclqjVwxV0f0oee7h+F6KWS8thVXtMmfBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T01:48:26.754525Z"},"content_sha256":"b31f2c5bf9f4c7ca52b6c2f01c58f502f002b370d4a951442d4b0747f8e43c25","schema_version":"1.0","event_id":"sha256:b31f2c5bf9f4c7ca52b6c2f01c58f502f002b370d4a951442d4b0747f8e43c25"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:B2KDGEPST4V2GKHZAHPG4YSDPS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Treewidth is a lower bound on graph gonality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dion Gijswijt, Josse van Dobben de Bruyn","submitted_at":"2014-07-25T20:50:30Z","abstract_excerpt":"We prove that the (divisorial) gonality of a finite connected graph is lower bounded by its treewidth. We show that equality holds for grid graphs and complete multipartite graphs.\n  We prove that the treewidth lower bound also holds for \\emph{metric graphs} by constructing for any positive rank divisor on a metric graph $\\Gamma$ a positive rank divisor of the same degree on a subdivision of the underlying graph.\n  Finally, we show that the treewidth lower bound also holds for a related notion of gonality defined by Caporaso and for stable gonality as introduced by Cornelissen et al."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.7055","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1407.7055/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T03:44:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cBtiVNeHq2UACTPNz2bzPFuTczKuKNlUBec1g6VZWmNwhACzo+41GHSr9FMJHXVb9dUmbaK9oK8rMxqi+xStBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T01:48:26.755028Z"},"content_sha256":"52d38ce00e51b74f904bec3194a7b4b31fb2bb81407f30dad2d6f98460bff8d4","schema_version":"1.0","event_id":"sha256:52d38ce00e51b74f904bec3194a7b4b31fb2bb81407f30dad2d6f98460bff8d4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B2KDGEPST4V2GKHZAHPG4YSDPS/bundle.json","state_url":"https://pith.science/pith/B2KDGEPST4V2GKHZAHPG4YSDPS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B2KDGEPST4V2GKHZAHPG4YSDPS/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-08-17T01:48:26Z","links":{"resolver":"https://pith.science/pith/B2KDGEPST4V2GKHZAHPG4YSDPS","bundle":"https://pith.science/pith/B2KDGEPST4V2GKHZAHPG4YSDPS/bundle.json","state":"https://pith.science/pith/B2KDGEPST4V2GKHZAHPG4YSDPS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B2KDGEPST4V2GKHZAHPG4YSDPS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:B2KDGEPST4V2GKHZAHPG4YSDPS","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":"5dc3c30ed29777264a400d2338380068c9a8dab1516dae7e2e29c3767a9f9e34","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-25T20:50:30Z","title_canon_sha256":"7f2624988ab9fe1930429f310df5d2b0d4fdb8ccb2ac68f8386ab2abcbce8edb"},"schema_version":"1.0","source":{"id":"1407.7055","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.7055","created_at":"2026-07-05T03:44:48Z"},{"alias_kind":"arxiv_version","alias_value":"1407.7055v2","created_at":"2026-07-05T03:44:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.7055","created_at":"2026-07-05T03:44:48Z"},{"alias_kind":"pith_short_12","alias_value":"B2KDGEPST4V2","created_at":"2026-07-05T03:44:48Z"},{"alias_kind":"pith_short_16","alias_value":"B2KDGEPST4V2GKHZ","created_at":"2026-07-05T03:44:48Z"},{"alias_kind":"pith_short_8","alias_value":"B2KDGEPS","created_at":"2026-07-05T03:44:48Z"}],"graph_snapshots":[{"event_id":"sha256:52d38ce00e51b74f904bec3194a7b4b31fb2bb81407f30dad2d6f98460bff8d4","target":"graph","created_at":"2026-07-05T03:44:48Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1407.7055/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We prove that the (divisorial) gonality of a finite connected graph is lower bounded by its treewidth. We show that equality holds for grid graphs and complete multipartite graphs.\n  We prove that the treewidth lower bound also holds for \\emph{metric graphs} by constructing for any positive rank divisor on a metric graph $\\Gamma$ a positive rank divisor of the same degree on a subdivision of the underlying graph.\n  Finally, we show that the treewidth lower bound also holds for a related notion of gonality defined by Caporaso and for stable gonality as introduced by Cornelissen et al.","authors_text":"Dion Gijswijt, Josse van Dobben de Bruyn","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-25T20:50:30Z","title":"Treewidth is a lower bound on graph gonality"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.7055","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:b31f2c5bf9f4c7ca52b6c2f01c58f502f002b370d4a951442d4b0747f8e43c25","target":"record","created_at":"2026-07-05T03:44:48Z","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":"5dc3c30ed29777264a400d2338380068c9a8dab1516dae7e2e29c3767a9f9e34","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-25T20:50:30Z","title_canon_sha256":"7f2624988ab9fe1930429f310df5d2b0d4fdb8ccb2ac68f8386ab2abcbce8edb"},"schema_version":"1.0","source":{"id":"1407.7055","kind":"arxiv","version":2}},"canonical_sha256":"0e943311f29f2ba328f901de6e62437c938309fe43834a6169ddc227db4ce9be","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0e943311f29f2ba328f901de6e62437c938309fe43834a6169ddc227db4ce9be","first_computed_at":"2026-07-05T03:44:48.083643Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:44:48.083643Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VZChLCNrp+dY2EQzkYzgu63tOROrPI8z0IIUSxzVTaXjEvVwvE2eyoP3a6aRMmQqEbb6AbJ/+S+jEaNiv6fvBg==","signature_status":"signed_v1","signed_at":"2026-07-05T03:44:48.084169Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.7055","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b31f2c5bf9f4c7ca52b6c2f01c58f502f002b370d4a951442d4b0747f8e43c25","sha256:52d38ce00e51b74f904bec3194a7b4b31fb2bb81407f30dad2d6f98460bff8d4"],"state_sha256":"8f6bc2bef3481ffe559f1b800121bccdacc0c951c3540124bd2d3689ab6562b2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QeYdncqMK8l8xlmU0HEgzeP3kEM7NSRbJ0mmoTo9IlK9KUucL3PpYoHfSwLs3D9qCR7OLdpKuFF4AZ43wPVAAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T01:48:26.761053Z","bundle_sha256":"1ca990473aea03395493b24aa0fe354b479547a9ce14a1de8f0aa3b447fc1fdc"}}