{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:WPVX4ZU2KOY3VVD65Q2RNN7O35","short_pith_number":"pith:WPVX4ZU2","canonical_record":{"source":{"id":"2108.09821","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-08-22T19:05:44Z","cross_cats_sorted":["math.AG"],"title_canon_sha256":"d13bb41576bdfdfc92451d182cdc39ecf306110409e57a6faa1294ec16e210f8","abstract_canon_sha256":"256dff63851ae059153021a45ae049c26ff0fc8b86871463cac5a7690febead9"},"schema_version":"1.0"},"canonical_sha256":"b3eb7e669a53b1bad47eec3516b7eedf4346b3d56d7d08e9596611aeab79dbcf","source":{"kind":"arxiv","id":"2108.09821","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2108.09821","created_at":"2026-07-05T06:37:09Z"},{"alias_kind":"arxiv_version","alias_value":"2108.09821v2","created_at":"2026-07-05T06:37:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.09821","created_at":"2026-07-05T06:37:09Z"},{"alias_kind":"pith_short_12","alias_value":"WPVX4ZU2KOY3","created_at":"2026-07-05T06:37:09Z"},{"alias_kind":"pith_short_16","alias_value":"WPVX4ZU2KOY3VVD6","created_at":"2026-07-05T06:37:09Z"},{"alias_kind":"pith_short_8","alias_value":"WPVX4ZU2","created_at":"2026-07-05T06:37:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:WPVX4ZU2KOY3VVD65Q2RNN7O35","target":"record","payload":{"canonical_record":{"source":{"id":"2108.09821","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-08-22T19:05:44Z","cross_cats_sorted":["math.AG"],"title_canon_sha256":"d13bb41576bdfdfc92451d182cdc39ecf306110409e57a6faa1294ec16e210f8","abstract_canon_sha256":"256dff63851ae059153021a45ae049c26ff0fc8b86871463cac5a7690febead9"},"schema_version":"1.0"},"canonical_sha256":"b3eb7e669a53b1bad47eec3516b7eedf4346b3d56d7d08e9596611aeab79dbcf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:37:09.607494Z","signature_b64":"i54WAbEyFcewDRlYiFRy0aq8MRz5uFReJ+fN3720ykV/vy+aqrzvBUGe1MfXNBetLD9gJPHnUdHG8TyJs2ZCBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b3eb7e669a53b1bad47eec3516b7eedf4346b3d56d7d08e9596611aeab79dbcf","last_reissued_at":"2026-07-05T06:37:09.607108Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:37:09.607108Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2108.09821","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-05T06:37:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o4/mBZ4GJxTuQOpwloLMFWVNhTmjFpGPd+s3ORMWopIBPvqUbb592r99eASj3eUPYGe7SXwQ7XUPzIMxK1OzDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T07:19:55.391968Z"},"content_sha256":"63a3e715f85e9d9a4f154e6db7f8feb5e3a71a1bbb3a91de90dfa19c25827373","schema_version":"1.0","event_id":"sha256:63a3e715f85e9d9a4f154e6db7f8feb5e3a71a1bbb3a91de90dfa19c25827373"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:WPVX4ZU2KOY3VVD65Q2RNN7O35","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Uniform scrambles on 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":"2021-08-22T19:05:44Z","abstract_excerpt":"A scramble on a connected multigraph is a collection of connected subgraphs that generalizes the notion of a bramble. The maximum order of a scramble, called the scramble number of a graph, was recently developed as a tool for lower bounding divisorial gonality. We present results on the scramble of all connected subgraphs with a fixed number of vertices, using these to calculate scramble number and gonality both for large families of graphs, and for specific examples like the $4$- and $5$-dimensional hypercube graphs. We also study the computational complexity of the egg-cut number of a scram"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.09821","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/2108.09821/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-05T06:37:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r9PkV9R+oOROx6pEDU3/rBUNRszp7ubxkkzTTuR9tdnuGbDt5WJkl2AppiZcuRZXbJmxlIW16jVTP02cwA1MCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T07:19:55.392373Z"},"content_sha256":"840903d27e0c69864f3ba38754e1f8e2a6f67749bf6076cc810e77f327eac7fa","schema_version":"1.0","event_id":"sha256:840903d27e0c69864f3ba38754e1f8e2a6f67749bf6076cc810e77f327eac7fa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WPVX4ZU2KOY3VVD65Q2RNN7O35/bundle.json","state_url":"https://pith.science/pith/WPVX4ZU2KOY3VVD65Q2RNN7O35/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WPVX4ZU2KOY3VVD65Q2RNN7O35/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-07T07:19:55Z","links":{"resolver":"https://pith.science/pith/WPVX4ZU2KOY3VVD65Q2RNN7O35","bundle":"https://pith.science/pith/WPVX4ZU2KOY3VVD65Q2RNN7O35/bundle.json","state":"https://pith.science/pith/WPVX4ZU2KOY3VVD65Q2RNN7O35/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WPVX4ZU2KOY3VVD65Q2RNN7O35/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:WPVX4ZU2KOY3VVD65Q2RNN7O35","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":"256dff63851ae059153021a45ae049c26ff0fc8b86871463cac5a7690febead9","cross_cats_sorted":["math.AG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-08-22T19:05:44Z","title_canon_sha256":"d13bb41576bdfdfc92451d182cdc39ecf306110409e57a6faa1294ec16e210f8"},"schema_version":"1.0","source":{"id":"2108.09821","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2108.09821","created_at":"2026-07-05T06:37:09Z"},{"alias_kind":"arxiv_version","alias_value":"2108.09821v2","created_at":"2026-07-05T06:37:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.09821","created_at":"2026-07-05T06:37:09Z"},{"alias_kind":"pith_short_12","alias_value":"WPVX4ZU2KOY3","created_at":"2026-07-05T06:37:09Z"},{"alias_kind":"pith_short_16","alias_value":"WPVX4ZU2KOY3VVD6","created_at":"2026-07-05T06:37:09Z"},{"alias_kind":"pith_short_8","alias_value":"WPVX4ZU2","created_at":"2026-07-05T06:37:09Z"}],"graph_snapshots":[{"event_id":"sha256:840903d27e0c69864f3ba38754e1f8e2a6f67749bf6076cc810e77f327eac7fa","target":"graph","created_at":"2026-07-05T06:37:09Z","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/2108.09821/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A scramble on a connected multigraph is a collection of connected subgraphs that generalizes the notion of a bramble. The maximum order of a scramble, called the scramble number of a graph, was recently developed as a tool for lower bounding divisorial gonality. We present results on the scramble of all connected subgraphs with a fixed number of vertices, using these to calculate scramble number and gonality both for large families of graphs, and for specific examples like the $4$- and $5$-dimensional hypercube graphs. We also study the computational complexity of the egg-cut number of a scram","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":"2021-08-22T19:05:44Z","title":"Uniform scrambles on graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.09821","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:63a3e715f85e9d9a4f154e6db7f8feb5e3a71a1bbb3a91de90dfa19c25827373","target":"record","created_at":"2026-07-05T06:37:09Z","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":"256dff63851ae059153021a45ae049c26ff0fc8b86871463cac5a7690febead9","cross_cats_sorted":["math.AG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-08-22T19:05:44Z","title_canon_sha256":"d13bb41576bdfdfc92451d182cdc39ecf306110409e57a6faa1294ec16e210f8"},"schema_version":"1.0","source":{"id":"2108.09821","kind":"arxiv","version":2}},"canonical_sha256":"b3eb7e669a53b1bad47eec3516b7eedf4346b3d56d7d08e9596611aeab79dbcf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b3eb7e669a53b1bad47eec3516b7eedf4346b3d56d7d08e9596611aeab79dbcf","first_computed_at":"2026-07-05T06:37:09.607108Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:37:09.607108Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"i54WAbEyFcewDRlYiFRy0aq8MRz5uFReJ+fN3720ykV/vy+aqrzvBUGe1MfXNBetLD9gJPHnUdHG8TyJs2ZCBA==","signature_status":"signed_v1","signed_at":"2026-07-05T06:37:09.607494Z","signed_message":"canonical_sha256_bytes"},"source_id":"2108.09821","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:63a3e715f85e9d9a4f154e6db7f8feb5e3a71a1bbb3a91de90dfa19c25827373","sha256:840903d27e0c69864f3ba38754e1f8e2a6f67749bf6076cc810e77f327eac7fa"],"state_sha256":"7c4e0d526f0fea3128078cf5262449ee50a5a2188ea77acd8fa5c13e1b565f31"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Arc7JdQn0LxrfvJDKlGXnARMIck011Y00XQMTz1DOwMkSudY5P+U0mFdHml+Abj8RfQu7hARMdw7UFnCA2xrDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T07:19:55.395228Z","bundle_sha256":"2d9f889ed69c00fa010ab0b3fe4b5557039fa54fdba04c87916e1a9d847f41a8"}}