{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:WPVX4ZU2KOY3VVD65Q2RNN7O35","short_pith_number":"pith:WPVX4ZU2","schema_version":"1.0","canonical_sha256":"b3eb7e669a53b1bad47eec3516b7eedf4346b3d56d7d08e9596611aeab79dbcf","source":{"kind":"arxiv","id":"2108.09821","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2108.09821","created_at":"2026-07-05T06:37:09.607165+00:00"},{"alias_kind":"arxiv_version","alias_value":"2108.09821v2","created_at":"2026-07-05T06:37:09.607165+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.09821","created_at":"2026-07-05T06:37:09.607165+00:00"},{"alias_kind":"pith_short_12","alias_value":"WPVX4ZU2KOY3","created_at":"2026-07-05T06:37:09.607165+00:00"},{"alias_kind":"pith_short_16","alias_value":"WPVX4ZU2KOY3VVD6","created_at":"2026-07-05T06:37:09.607165+00:00"},{"alias_kind":"pith_short_8","alias_value":"WPVX4ZU2","created_at":"2026-07-05T06:37:09.607165+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WPVX4ZU2KOY3VVD65Q2RNN7O35","json":"https://pith.science/pith/WPVX4ZU2KOY3VVD65Q2RNN7O35.json","graph_json":"https://pith.science/api/pith-number/WPVX4ZU2KOY3VVD65Q2RNN7O35/graph.json","events_json":"https://pith.science/api/pith-number/WPVX4ZU2KOY3VVD65Q2RNN7O35/events.json","paper":"https://pith.science/paper/WPVX4ZU2"},"agent_actions":{"view_html":"https://pith.science/pith/WPVX4ZU2KOY3VVD65Q2RNN7O35","download_json":"https://pith.science/pith/WPVX4ZU2KOY3VVD65Q2RNN7O35.json","view_paper":"https://pith.science/paper/WPVX4ZU2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2108.09821&json=true","fetch_graph":"https://pith.science/api/pith-number/WPVX4ZU2KOY3VVD65Q2RNN7O35/graph.json","fetch_events":"https://pith.science/api/pith-number/WPVX4ZU2KOY3VVD65Q2RNN7O35/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WPVX4ZU2KOY3VVD65Q2RNN7O35/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WPVX4ZU2KOY3VVD65Q2RNN7O35/action/storage_attestation","attest_author":"https://pith.science/pith/WPVX4ZU2KOY3VVD65Q2RNN7O35/action/author_attestation","sign_citation":"https://pith.science/pith/WPVX4ZU2KOY3VVD65Q2RNN7O35/action/citation_signature","submit_replication":"https://pith.science/pith/WPVX4ZU2KOY3VVD65Q2RNN7O35/action/replication_record"}},"created_at":"2026-07-05T06:37:09.607165+00:00","updated_at":"2026-07-05T06:37:09.607165+00:00"}