{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:UHA2V5ZMUU56MBAIACNCXKOXTC","short_pith_number":"pith:UHA2V5ZM","canonical_record":{"source":{"id":"2508.05761","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-08-07T18:20:02Z","cross_cats_sorted":["math.AG"],"title_canon_sha256":"9cdcc2c68f9661202cb966c2016f56c0420e7a532235774112e98514b0248dc8","abstract_canon_sha256":"6f7a98a8f186373829c9a8beef90a6f6a6d417f1504ac92adffffc7237f98a19"},"schema_version":"1.0"},"canonical_sha256":"a1c1aaf72ca53be60408009a2ba9d798a41cf7ac009c75cdd9dd5565be91a872","source":{"kind":"arxiv","id":"2508.05761","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.05761","created_at":"2026-07-05T11:50:42Z"},{"alias_kind":"arxiv_version","alias_value":"2508.05761v1","created_at":"2026-07-05T11:50:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.05761","created_at":"2026-07-05T11:50:42Z"},{"alias_kind":"pith_short_12","alias_value":"UHA2V5ZMUU56","created_at":"2026-07-05T11:50:42Z"},{"alias_kind":"pith_short_16","alias_value":"UHA2V5ZMUU56MBAI","created_at":"2026-07-05T11:50:42Z"},{"alias_kind":"pith_short_8","alias_value":"UHA2V5ZM","created_at":"2026-07-05T11:50:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:UHA2V5ZMUU56MBAIACNCXKOXTC","target":"record","payload":{"canonical_record":{"source":{"id":"2508.05761","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-08-07T18:20:02Z","cross_cats_sorted":["math.AG"],"title_canon_sha256":"9cdcc2c68f9661202cb966c2016f56c0420e7a532235774112e98514b0248dc8","abstract_canon_sha256":"6f7a98a8f186373829c9a8beef90a6f6a6d417f1504ac92adffffc7237f98a19"},"schema_version":"1.0"},"canonical_sha256":"a1c1aaf72ca53be60408009a2ba9d798a41cf7ac009c75cdd9dd5565be91a872","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:50:42.969461Z","signature_b64":"Wc+5M90aOXmk7Z8nk9i5ylMA29m9r2bshSfUEpgdeqVwTzCFhR78QIZhiVOa3gY/gOLGX29eD4VA7lNQFBFVAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a1c1aaf72ca53be60408009a2ba9d798a41cf7ac009c75cdd9dd5565be91a872","last_reissued_at":"2026-07-05T11:50:42.968911Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:50:42.968911Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2508.05761","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-05T11:50:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LtWf8nizu5gX0CnKeBHc5Bv8rBvtF4bpzWrwr7POzG+Wmpt1IndACGtrRSWcr510YaKqGJ7x0dGgTX751dX+Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T13:43:57.550681Z"},"content_sha256":"fab20f3375bf54ac751e7f2c0e01e3e7de1a6865730368900358770caa33df40","schema_version":"1.0","event_id":"sha256:fab20f3375bf54ac751e7f2c0e01e3e7de1a6865730368900358770caa33df40"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:UHA2V5ZMUU56MBAIACNCXKOXTC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The gonality of circulant graphs","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":"2025-08-07T18:20:02Z","abstract_excerpt":"The gonality of a graph measures how difficult it is to move chips around the entirety of a graph according to certain chip-firing rules without introducing debt. In this paper we study the gonality of circulant graphs, a class of vertex-transitive graphs that can be specified by their number of vertices together with a list of cyclic adjacency relations satisfied by all vertices. We provide a universal upper bound on the gonality of all circulant graphs with a fixed adjacency list, which holds irrespective of the number of vertices. We use this upper bound together with computational methods "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.05761","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/2508.05761/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-05T11:50:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sbwpu0yPuVsgTC7XcYCMqERuCTDdWbHT2pPs9Kv3UV3jT8Sf2LiyswWJUYQu+wNKaC6sGmK29DRwcc8jagGaDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T13:43:57.551056Z"},"content_sha256":"042adbbd06b93c043da48caffd69fe6f568b9eb1cbece96a37029cee79899dcc","schema_version":"1.0","event_id":"sha256:042adbbd06b93c043da48caffd69fe6f568b9eb1cbece96a37029cee79899dcc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UHA2V5ZMUU56MBAIACNCXKOXTC/bundle.json","state_url":"https://pith.science/pith/UHA2V5ZMUU56MBAIACNCXKOXTC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UHA2V5ZMUU56MBAIACNCXKOXTC/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-07T13:43:57Z","links":{"resolver":"https://pith.science/pith/UHA2V5ZMUU56MBAIACNCXKOXTC","bundle":"https://pith.science/pith/UHA2V5ZMUU56MBAIACNCXKOXTC/bundle.json","state":"https://pith.science/pith/UHA2V5ZMUU56MBAIACNCXKOXTC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UHA2V5ZMUU56MBAIACNCXKOXTC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:UHA2V5ZMUU56MBAIACNCXKOXTC","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":"6f7a98a8f186373829c9a8beef90a6f6a6d417f1504ac92adffffc7237f98a19","cross_cats_sorted":["math.AG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-08-07T18:20:02Z","title_canon_sha256":"9cdcc2c68f9661202cb966c2016f56c0420e7a532235774112e98514b0248dc8"},"schema_version":"1.0","source":{"id":"2508.05761","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.05761","created_at":"2026-07-05T11:50:42Z"},{"alias_kind":"arxiv_version","alias_value":"2508.05761v1","created_at":"2026-07-05T11:50:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.05761","created_at":"2026-07-05T11:50:42Z"},{"alias_kind":"pith_short_12","alias_value":"UHA2V5ZMUU56","created_at":"2026-07-05T11:50:42Z"},{"alias_kind":"pith_short_16","alias_value":"UHA2V5ZMUU56MBAI","created_at":"2026-07-05T11:50:42Z"},{"alias_kind":"pith_short_8","alias_value":"UHA2V5ZM","created_at":"2026-07-05T11:50:42Z"}],"graph_snapshots":[{"event_id":"sha256:042adbbd06b93c043da48caffd69fe6f568b9eb1cbece96a37029cee79899dcc","target":"graph","created_at":"2026-07-05T11:50:42Z","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/2508.05761/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The gonality of a graph measures how difficult it is to move chips around the entirety of a graph according to certain chip-firing rules without introducing debt. In this paper we study the gonality of circulant graphs, a class of vertex-transitive graphs that can be specified by their number of vertices together with a list of cyclic adjacency relations satisfied by all vertices. We provide a universal upper bound on the gonality of all circulant graphs with a fixed adjacency list, which holds irrespective of the number of vertices. We use this upper bound together with computational methods ","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":"2025-08-07T18:20:02Z","title":"The gonality of circulant graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.05761","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:fab20f3375bf54ac751e7f2c0e01e3e7de1a6865730368900358770caa33df40","target":"record","created_at":"2026-07-05T11:50:42Z","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":"6f7a98a8f186373829c9a8beef90a6f6a6d417f1504ac92adffffc7237f98a19","cross_cats_sorted":["math.AG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-08-07T18:20:02Z","title_canon_sha256":"9cdcc2c68f9661202cb966c2016f56c0420e7a532235774112e98514b0248dc8"},"schema_version":"1.0","source":{"id":"2508.05761","kind":"arxiv","version":1}},"canonical_sha256":"a1c1aaf72ca53be60408009a2ba9d798a41cf7ac009c75cdd9dd5565be91a872","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a1c1aaf72ca53be60408009a2ba9d798a41cf7ac009c75cdd9dd5565be91a872","first_computed_at":"2026-07-05T11:50:42.968911Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:50:42.968911Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Wc+5M90aOXmk7Z8nk9i5ylMA29m9r2bshSfUEpgdeqVwTzCFhR78QIZhiVOa3gY/gOLGX29eD4VA7lNQFBFVAg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:50:42.969461Z","signed_message":"canonical_sha256_bytes"},"source_id":"2508.05761","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fab20f3375bf54ac751e7f2c0e01e3e7de1a6865730368900358770caa33df40","sha256:042adbbd06b93c043da48caffd69fe6f568b9eb1cbece96a37029cee79899dcc"],"state_sha256":"b6f6eb6fea3293a24c74138207c21104caabd033dff54a76d889fae98cc6b411"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bslbJeZl8iHdhSxdceYqYrj2w8gayIbw3T2fxob94ZDaRtc2Cz4SK36RB4M1bKyaDgFf6SZspyX/gS21a8u8Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T13:43:57.552978Z","bundle_sha256":"0886b04f4bcd4ba009d4c207c191665b5abab6ab43b95421c0117f6a7c1203d1"}}