{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:KCNWAR7AEVPC3K2ATOV7UV6HWV","short_pith_number":"pith:KCNWAR7A","schema_version":"1.0","canonical_sha256":"509b6047e0255e2dab409babfa57c7b571a0900207d5fcde131ef00a21d6c73e","source":{"kind":"arxiv","id":"1111.6024","version":1},"attestation_state":"computed","paper":{"title":"Minor crossing number is additive over arbitrary cuts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Drago Bokal, Jes\\'us Lea\\~nos, Markus Chimani","submitted_at":"2011-11-25T15:33:33Z","abstract_excerpt":"We prove that if $G$ is a graph with an minimal edge cut $F$ of size three and $G_1$, $G_2$ are the two (augmented) components of $G-F$, then the crossing number of $G$ is equal to the sum of crossing numbers of $G_1$ and $G_2$. Combining with known results, this implies that crossing number is additive over edge-cuts of size $d$ for $d\\in\\{0, 1, 2, 3\\}$, whereas there are counterexamples for every $d\\ge 4$. The techniques generalize to show that minor crossing number is additive over edge cuts of arbitrary size, as well as to provide bounds for crossing number additivity in arbitrary surfaces"},"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":"1111.6024","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-25T15:33:33Z","cross_cats_sorted":[],"title_canon_sha256":"422cbb6d26f9dabd85650dfef40aae0219f7b47cd50e19eb6a676a1c1ee253bd","abstract_canon_sha256":"0440fd37c86a31aa73c49349f30d562fead5d2bb44ed149b0eaa978fdf41916e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:07:41.243931Z","signature_b64":"KYuEybwumQ9wzLkkLLH+eOqlsIJTAAvwn4DfS07ip7W7kxfdvCM/bnE3pwYG4+TVBlCSQRTzl0mMB0C0LFZzBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"509b6047e0255e2dab409babfa57c7b571a0900207d5fcde131ef00a21d6c73e","last_reissued_at":"2026-05-18T04:07:41.243151Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:07:41.243151Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minor crossing number is additive over arbitrary cuts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Drago Bokal, Jes\\'us Lea\\~nos, Markus Chimani","submitted_at":"2011-11-25T15:33:33Z","abstract_excerpt":"We prove that if $G$ is a graph with an minimal edge cut $F$ of size three and $G_1$, $G_2$ are the two (augmented) components of $G-F$, then the crossing number of $G$ is equal to the sum of crossing numbers of $G_1$ and $G_2$. Combining with known results, this implies that crossing number is additive over edge-cuts of size $d$ for $d\\in\\{0, 1, 2, 3\\}$, whereas there are counterexamples for every $d\\ge 4$. The techniques generalize to show that minor crossing number is additive over edge cuts of arbitrary size, as well as to provide bounds for crossing number additivity in arbitrary surfaces"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.6024","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":"1111.6024","created_at":"2026-05-18T04:07:41.243298+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.6024v1","created_at":"2026-05-18T04:07:41.243298+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.6024","created_at":"2026-05-18T04:07:41.243298+00:00"},{"alias_kind":"pith_short_12","alias_value":"KCNWAR7AEVPC","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_16","alias_value":"KCNWAR7AEVPC3K2A","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_8","alias_value":"KCNWAR7A","created_at":"2026-05-18T12:26:32.869790+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/KCNWAR7AEVPC3K2ATOV7UV6HWV","json":"https://pith.science/pith/KCNWAR7AEVPC3K2ATOV7UV6HWV.json","graph_json":"https://pith.science/api/pith-number/KCNWAR7AEVPC3K2ATOV7UV6HWV/graph.json","events_json":"https://pith.science/api/pith-number/KCNWAR7AEVPC3K2ATOV7UV6HWV/events.json","paper":"https://pith.science/paper/KCNWAR7A"},"agent_actions":{"view_html":"https://pith.science/pith/KCNWAR7AEVPC3K2ATOV7UV6HWV","download_json":"https://pith.science/pith/KCNWAR7AEVPC3K2ATOV7UV6HWV.json","view_paper":"https://pith.science/paper/KCNWAR7A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.6024&json=true","fetch_graph":"https://pith.science/api/pith-number/KCNWAR7AEVPC3K2ATOV7UV6HWV/graph.json","fetch_events":"https://pith.science/api/pith-number/KCNWAR7AEVPC3K2ATOV7UV6HWV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KCNWAR7AEVPC3K2ATOV7UV6HWV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KCNWAR7AEVPC3K2ATOV7UV6HWV/action/storage_attestation","attest_author":"https://pith.science/pith/KCNWAR7AEVPC3K2ATOV7UV6HWV/action/author_attestation","sign_citation":"https://pith.science/pith/KCNWAR7AEVPC3K2ATOV7UV6HWV/action/citation_signature","submit_replication":"https://pith.science/pith/KCNWAR7AEVPC3K2ATOV7UV6HWV/action/replication_record"}},"created_at":"2026-05-18T04:07:41.243298+00:00","updated_at":"2026-05-18T04:07:41.243298+00:00"}