{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:7JDI5K4MB7OYJ4JJMVIMIV7WOW","short_pith_number":"pith:7JDI5K4M","canonical_record":{"source":{"id":"2206.06907","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-06-14T15:02:43Z","cross_cats_sorted":["math.AG"],"title_canon_sha256":"b2fcbe82d863a1c2dc89f24439eb00cace26970658b09dc675ce88a645fecb63","abstract_canon_sha256":"26755d56161ee76f7742df1b90013ef9759093f6a24a172539f7308eecfac1ab"},"schema_version":"1.0"},"canonical_sha256":"fa468eab8c0fdd84f1296550c457f675abac174c2d48936bb14de06419ba8bdb","source":{"kind":"arxiv","id":"2206.06907","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2206.06907","created_at":"2026-07-05T04:31:47Z"},{"alias_kind":"arxiv_version","alias_value":"2206.06907v1","created_at":"2026-07-05T04:31:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.06907","created_at":"2026-07-05T04:31:47Z"},{"alias_kind":"pith_short_12","alias_value":"7JDI5K4MB7OY","created_at":"2026-07-05T04:31:47Z"},{"alias_kind":"pith_short_16","alias_value":"7JDI5K4MB7OYJ4JJ","created_at":"2026-07-05T04:31:47Z"},{"alias_kind":"pith_short_8","alias_value":"7JDI5K4M","created_at":"2026-07-05T04:31:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:7JDI5K4MB7OYJ4JJMVIMIV7WOW","target":"record","payload":{"canonical_record":{"source":{"id":"2206.06907","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-06-14T15:02:43Z","cross_cats_sorted":["math.AG"],"title_canon_sha256":"b2fcbe82d863a1c2dc89f24439eb00cace26970658b09dc675ce88a645fecb63","abstract_canon_sha256":"26755d56161ee76f7742df1b90013ef9759093f6a24a172539f7308eecfac1ab"},"schema_version":"1.0"},"canonical_sha256":"fa468eab8c0fdd84f1296550c457f675abac174c2d48936bb14de06419ba8bdb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:31:47.190824Z","signature_b64":"3UwKJCEnZJ/IAe0y6NourG8/3jSVK5kXKXgHPMEMeXdvnB8WUme1rcXjqB4GvqjHydXHbWlGBwSC3RSwmJ19Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa468eab8c0fdd84f1296550c457f675abac174c2d48936bb14de06419ba8bdb","last_reissued_at":"2026-07-05T04:31:47.190351Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:31:47.190351Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2206.06907","source_version":1,"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-05T04:31:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eLG3RhtGGAfPJGd4DmLdDOYIPbjpOlsc2KzgqZ4A6sSAXp9zlegs48o0Zrxd6XXvd7M77VFXzCJ2KqIZGmJEDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T17:01:11.021232Z"},"content_sha256":"fa19f56a86017e49ea38316d1e997d99e5280468f7afbae4e5e7423692e5ff51","schema_version":"1.0","event_id":"sha256:fa19f56a86017e49ea38316d1e997d99e5280468f7afbae4e5e7423692e5ff51"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:7JDI5K4MB7OYJ4JJMVIMIV7WOW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bounds on higher graph gonality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG"],"primary_cat":"math.CO","authors_text":"Cassandra Marcussen, Eyobel Gebre, Jason Meintjes, Lisa Cenek, Liz Ostermeyer, Lizzie Ferguson, Ralph Morrison, Shefali Ramakrishna","submitted_at":"2022-06-14T15:02:43Z","abstract_excerpt":"We prove new lower and upper bounds on the higher gonalities of finite graphs. These bounds are generalizations of known upper and lower bounds for first gonality to higher gonalities, including upper bounds on gonality involving independence number, and lower bounds on gonality by scramble number. We apply our bounds to study the computational complexity of computing higher gonalities, proving that it is NP-hard to compute the second gonality of a graph when restricting to multiplicity-free divisors."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.06907","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2206.06907/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-05T04:31:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fyTSs8LhF7Yd2S+OA1FjIlqZQr7EYFfqGNF5a5HWmTLgxcqfO5ihWVKHohzo16oqTT1jzWGD/MtjTsDIJTS0Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T17:01:11.021664Z"},"content_sha256":"8d32ab69538677c78c0378fe89bb1b1d0e1c344314cc2a8f13de28e1f0d9f770","schema_version":"1.0","event_id":"sha256:8d32ab69538677c78c0378fe89bb1b1d0e1c344314cc2a8f13de28e1f0d9f770"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7JDI5K4MB7OYJ4JJMVIMIV7WOW/bundle.json","state_url":"https://pith.science/pith/7JDI5K4MB7OYJ4JJMVIMIV7WOW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7JDI5K4MB7OYJ4JJMVIMIV7WOW/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-07-06T17:01:11Z","links":{"resolver":"https://pith.science/pith/7JDI5K4MB7OYJ4JJMVIMIV7WOW","bundle":"https://pith.science/pith/7JDI5K4MB7OYJ4JJMVIMIV7WOW/bundle.json","state":"https://pith.science/pith/7JDI5K4MB7OYJ4JJMVIMIV7WOW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7JDI5K4MB7OYJ4JJMVIMIV7WOW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:7JDI5K4MB7OYJ4JJMVIMIV7WOW","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":"26755d56161ee76f7742df1b90013ef9759093f6a24a172539f7308eecfac1ab","cross_cats_sorted":["math.AG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-06-14T15:02:43Z","title_canon_sha256":"b2fcbe82d863a1c2dc89f24439eb00cace26970658b09dc675ce88a645fecb63"},"schema_version":"1.0","source":{"id":"2206.06907","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2206.06907","created_at":"2026-07-05T04:31:47Z"},{"alias_kind":"arxiv_version","alias_value":"2206.06907v1","created_at":"2026-07-05T04:31:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.06907","created_at":"2026-07-05T04:31:47Z"},{"alias_kind":"pith_short_12","alias_value":"7JDI5K4MB7OY","created_at":"2026-07-05T04:31:47Z"},{"alias_kind":"pith_short_16","alias_value":"7JDI5K4MB7OYJ4JJ","created_at":"2026-07-05T04:31:47Z"},{"alias_kind":"pith_short_8","alias_value":"7JDI5K4M","created_at":"2026-07-05T04:31:47Z"}],"graph_snapshots":[{"event_id":"sha256:8d32ab69538677c78c0378fe89bb1b1d0e1c344314cc2a8f13de28e1f0d9f770","target":"graph","created_at":"2026-07-05T04:31:47Z","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/2206.06907/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We prove new lower and upper bounds on the higher gonalities of finite graphs. These bounds are generalizations of known upper and lower bounds for first gonality to higher gonalities, including upper bounds on gonality involving independence number, and lower bounds on gonality by scramble number. We apply our bounds to study the computational complexity of computing higher gonalities, proving that it is NP-hard to compute the second gonality of a graph when restricting to multiplicity-free divisors.","authors_text":"Cassandra Marcussen, Eyobel Gebre, Jason Meintjes, Lisa Cenek, Liz Ostermeyer, Lizzie Ferguson, Ralph Morrison, Shefali Ramakrishna","cross_cats":["math.AG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-06-14T15:02:43Z","title":"Bounds on higher graph gonality"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.06907","kind":"arxiv","version":1},"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:fa19f56a86017e49ea38316d1e997d99e5280468f7afbae4e5e7423692e5ff51","target":"record","created_at":"2026-07-05T04:31:47Z","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":"26755d56161ee76f7742df1b90013ef9759093f6a24a172539f7308eecfac1ab","cross_cats_sorted":["math.AG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-06-14T15:02:43Z","title_canon_sha256":"b2fcbe82d863a1c2dc89f24439eb00cace26970658b09dc675ce88a645fecb63"},"schema_version":"1.0","source":{"id":"2206.06907","kind":"arxiv","version":1}},"canonical_sha256":"fa468eab8c0fdd84f1296550c457f675abac174c2d48936bb14de06419ba8bdb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fa468eab8c0fdd84f1296550c457f675abac174c2d48936bb14de06419ba8bdb","first_computed_at":"2026-07-05T04:31:47.190351Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:31:47.190351Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3UwKJCEnZJ/IAe0y6NourG8/3jSVK5kXKXgHPMEMeXdvnB8WUme1rcXjqB4GvqjHydXHbWlGBwSC3RSwmJ19Bg==","signature_status":"signed_v1","signed_at":"2026-07-05T04:31:47.190824Z","signed_message":"canonical_sha256_bytes"},"source_id":"2206.06907","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fa19f56a86017e49ea38316d1e997d99e5280468f7afbae4e5e7423692e5ff51","sha256:8d32ab69538677c78c0378fe89bb1b1d0e1c344314cc2a8f13de28e1f0d9f770"],"state_sha256":"0aa784efb2a809e1e67cdd8b4359b37d07a66510a21687e8fc09a3bbad80c5a9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mNDzCzurLhls9yX2XoRhS73ngxb6Y7ucoICfISslYnbwYpA80OwLbUULLH19+PjyJyB0DMbXtpwZghxc3dkkBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T17:01:11.023915Z","bundle_sha256":"6c15f0e7d7727a41d0e049986754cfe1ed4f6cb503f9bf51f3570a7830e5330d"}}