{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:KCNWAR7AEVPC3K2ATOV7UV6HWV","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":"0440fd37c86a31aa73c49349f30d562fead5d2bb44ed149b0eaa978fdf41916e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-25T15:33:33Z","title_canon_sha256":"422cbb6d26f9dabd85650dfef40aae0219f7b47cd50e19eb6a676a1c1ee253bd"},"schema_version":"1.0","source":{"id":"1111.6024","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.6024","created_at":"2026-05-18T04:07:41Z"},{"alias_kind":"arxiv_version","alias_value":"1111.6024v1","created_at":"2026-05-18T04:07:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.6024","created_at":"2026-05-18T04:07:41Z"},{"alias_kind":"pith_short_12","alias_value":"KCNWAR7AEVPC","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"KCNWAR7AEVPC3K2A","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"KCNWAR7A","created_at":"2026-05-18T12:26:32Z"}],"graph_snapshots":[{"event_id":"sha256:07677b6c1613ece55218226f48c0f18141b17537da172f3d9238437117df34c0","target":"graph","created_at":"2026-05-18T04:07:41Z","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":"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","authors_text":"Drago Bokal, Jes\\'us Lea\\~nos, Markus Chimani","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-25T15:33:33Z","title":"Minor crossing number is additive over arbitrary cuts"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.6024","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:2e0e2a7f60ccda98ef013be7de38d0b3967a1112b42cba26cbc995f518f0302f","target":"record","created_at":"2026-05-18T04:07:41Z","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":"0440fd37c86a31aa73c49349f30d562fead5d2bb44ed149b0eaa978fdf41916e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-25T15:33:33Z","title_canon_sha256":"422cbb6d26f9dabd85650dfef40aae0219f7b47cd50e19eb6a676a1c1ee253bd"},"schema_version":"1.0","source":{"id":"1111.6024","kind":"arxiv","version":1}},"canonical_sha256":"509b6047e0255e2dab409babfa57c7b571a0900207d5fcde131ef00a21d6c73e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"509b6047e0255e2dab409babfa57c7b571a0900207d5fcde131ef00a21d6c73e","first_computed_at":"2026-05-18T04:07:41.243151Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:07:41.243151Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KYuEybwumQ9wzLkkLLH+eOqlsIJTAAvwn4DfS07ip7W7kxfdvCM/bnE3pwYG4+TVBlCSQRTzl0mMB0C0LFZzBg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:07:41.243931Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.6024","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2e0e2a7f60ccda98ef013be7de38d0b3967a1112b42cba26cbc995f518f0302f","sha256:07677b6c1613ece55218226f48c0f18141b17537da172f3d9238437117df34c0"],"state_sha256":"3b4aa8993e301f9ca23841d05c5cc892af9e54cb3eb113ef396c02ee3fab1946"}