{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:W72CCI53VF5D72K6YUMYFM5IVE","short_pith_number":"pith:W72CCI53","schema_version":"1.0","canonical_sha256":"b7f42123bba97a3fe95ec51982b3a8a93ebd60b1a4175ea428ab94b89c805bf9","source":{"kind":"arxiv","id":"1807.11617","version":1},"attestation_state":"computed","paper":{"title":"Tight Upper Bounds on the Crossing Number in a Minor-Closed Class","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.CO","authors_text":"Bojan Mohar, David R. Wood, Ken-ichi Kawarabayashi, Vida Dujmovi\\'c","submitted_at":"2018-07-31T00:44:34Z","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"},"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":"1807.11617","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-31T00:44:34Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"3f761b3d5a15dd32a3f90ffacfb7b3639219b5b512fae1337c78417f3c071f5b","abstract_canon_sha256":"090eb8641a4a9d55c52c5febe362465b2271697f2385b02242072d2b1192901d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:21.598048Z","signature_b64":"ssS1Xxm0zqkSl1jzJMkXrwEA8XHNpqzkDmszP6OzfZftvLfUwsWdWHwJnilg7oK32zWg7f9gdgykRcCiQpjNCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b7f42123bba97a3fe95ec51982b3a8a93ebd60b1a4175ea428ab94b89c805bf9","last_reissued_at":"2026-05-18T00:09:21.597450Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:21.597450Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tight Upper Bounds on the Crossing Number in a Minor-Closed Class","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.CO","authors_text":"Bojan Mohar, David R. Wood, Ken-ichi Kawarabayashi, Vida Dujmovi\\'c","submitted_at":"2018-07-31T00:44:34Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.11617","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":""},"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":"1807.11617","created_at":"2026-05-18T00:09:21.597549+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.11617v1","created_at":"2026-05-18T00:09:21.597549+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.11617","created_at":"2026-05-18T00:09:21.597549+00:00"},{"alias_kind":"pith_short_12","alias_value":"W72CCI53VF5D","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"W72CCI53VF5D72K6","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"W72CCI53","created_at":"2026-05-18T12:32:59.047623+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/W72CCI53VF5D72K6YUMYFM5IVE","json":"https://pith.science/pith/W72CCI53VF5D72K6YUMYFM5IVE.json","graph_json":"https://pith.science/api/pith-number/W72CCI53VF5D72K6YUMYFM5IVE/graph.json","events_json":"https://pith.science/api/pith-number/W72CCI53VF5D72K6YUMYFM5IVE/events.json","paper":"https://pith.science/paper/W72CCI53"},"agent_actions":{"view_html":"https://pith.science/pith/W72CCI53VF5D72K6YUMYFM5IVE","download_json":"https://pith.science/pith/W72CCI53VF5D72K6YUMYFM5IVE.json","view_paper":"https://pith.science/paper/W72CCI53","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.11617&json=true","fetch_graph":"https://pith.science/api/pith-number/W72CCI53VF5D72K6YUMYFM5IVE/graph.json","fetch_events":"https://pith.science/api/pith-number/W72CCI53VF5D72K6YUMYFM5IVE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W72CCI53VF5D72K6YUMYFM5IVE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W72CCI53VF5D72K6YUMYFM5IVE/action/storage_attestation","attest_author":"https://pith.science/pith/W72CCI53VF5D72K6YUMYFM5IVE/action/author_attestation","sign_citation":"https://pith.science/pith/W72CCI53VF5D72K6YUMYFM5IVE/action/citation_signature","submit_replication":"https://pith.science/pith/W72CCI53VF5D72K6YUMYFM5IVE/action/replication_record"}},"created_at":"2026-05-18T00:09:21.597549+00:00","updated_at":"2026-05-18T00:09:21.597549+00:00"}