{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:W72CCI53VF5D72K6YUMYFM5IVE","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":"090eb8641a4a9d55c52c5febe362465b2271697f2385b02242072d2b1192901d","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-31T00:44:34Z","title_canon_sha256":"3f761b3d5a15dd32a3f90ffacfb7b3639219b5b512fae1337c78417f3c071f5b"},"schema_version":"1.0","source":{"id":"1807.11617","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.11617","created_at":"2026-05-18T00:09:21Z"},{"alias_kind":"arxiv_version","alias_value":"1807.11617v1","created_at":"2026-05-18T00:09:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.11617","created_at":"2026-05-18T00:09:21Z"},{"alias_kind":"pith_short_12","alias_value":"W72CCI53VF5D","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"W72CCI53VF5D72K6","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"W72CCI53","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:dba64a98a0020376516d762ccff21ad05b0f4029e8bab9a9c34670f92130d984","target":"graph","created_at":"2026-05-18T00:09:21Z","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"},"paper":{"abstract_excerpt":"The crossing number of a graph is the minimum number of crossings in a drawing of the graph in the plane. Our main result is that every graph $G$ that does not contain a fixed graph as a minor has crossing number $O(\\Delta n)$, where $G$ has $n$ vertices and maximum degree $\\Delta$. This dependence on $n$ and $\\Delta$ is best possible. This result answers an open question of Wood and Telle [New York J. Mathematics, 2007], who proved the best previous bound of $O(\\Delta^2 n)$. We also study the convex and rectilinear crossing numbers, and prove an $O(\\Delta n)$ bound for the convex crossing num","authors_text":"Bojan Mohar, David R. Wood, Ken-ichi Kawarabayashi, Vida Dujmovi\\'c","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-31T00:44:34Z","title":"Tight Upper Bounds on the Crossing Number in a Minor-Closed Class"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.11617","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:663b5b87a93dfed9c036bf699b910eabe2e9d8ed42bcb3d990be2e52870a31e9","target":"record","created_at":"2026-05-18T00:09:21Z","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":"090eb8641a4a9d55c52c5febe362465b2271697f2385b02242072d2b1192901d","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-31T00:44:34Z","title_canon_sha256":"3f761b3d5a15dd32a3f90ffacfb7b3639219b5b512fae1337c78417f3c071f5b"},"schema_version":"1.0","source":{"id":"1807.11617","kind":"arxiv","version":1}},"canonical_sha256":"b7f42123bba97a3fe95ec51982b3a8a93ebd60b1a4175ea428ab94b89c805bf9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b7f42123bba97a3fe95ec51982b3a8a93ebd60b1a4175ea428ab94b89c805bf9","first_computed_at":"2026-05-18T00:09:21.597450Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:09:21.597450Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ssS1Xxm0zqkSl1jzJMkXrwEA8XHNpqzkDmszP6OzfZftvLfUwsWdWHwJnilg7oK32zWg7f9gdgykRcCiQpjNCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:09:21.598048Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.11617","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:663b5b87a93dfed9c036bf699b910eabe2e9d8ed42bcb3d990be2e52870a31e9","sha256:dba64a98a0020376516d762ccff21ad05b0f4029e8bab9a9c34670f92130d984"],"state_sha256":"f5bddfcee9104f6a286b70e9a3902e8d7e69a9743c03005faaf2ed23a62f91d1"}