{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:SRKHSDSP32GEIHBQA3Y4QZ3P2O","short_pith_number":"pith:SRKHSDSP","canonical_record":{"source":{"id":"1203.0510","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-02T16:21:32Z","cross_cats_sorted":[],"title_canon_sha256":"1f9e74524c74df57040e557029161778a03d894543faea4c6804b9585e64a351","abstract_canon_sha256":"266e56d72813d35388aaafb4c40ca1339bee63bb6b87794d8c40814141c6058e"},"schema_version":"1.0"},"canonical_sha256":"9454790e4fde8c441c3006f1c8676fd39793847b4bac35fc192fa49f96556496","source":{"kind":"arxiv","id":"1203.0510","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.0510","created_at":"2026-05-18T04:01:00Z"},{"alias_kind":"arxiv_version","alias_value":"1203.0510v1","created_at":"2026-05-18T04:01:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.0510","created_at":"2026-05-18T04:01:00Z"},{"alias_kind":"pith_short_12","alias_value":"SRKHSDSP32GE","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"SRKHSDSP32GEIHBQ","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"SRKHSDSP","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:SRKHSDSP32GEIHBQA3Y4QZ3P2O","target":"record","payload":{"canonical_record":{"source":{"id":"1203.0510","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-02T16:21:32Z","cross_cats_sorted":[],"title_canon_sha256":"1f9e74524c74df57040e557029161778a03d894543faea4c6804b9585e64a351","abstract_canon_sha256":"266e56d72813d35388aaafb4c40ca1339bee63bb6b87794d8c40814141c6058e"},"schema_version":"1.0"},"canonical_sha256":"9454790e4fde8c441c3006f1c8676fd39793847b4bac35fc192fa49f96556496","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:01:00.528109Z","signature_b64":"abVRBf5PHPMvt6GMicOwV9D4tc+VoDj+ZfctHmJJ3V6grCETRLnTAXjsKk3MXa1/zmvxCPrYNUOcYOZt4ELhDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9454790e4fde8c441c3006f1c8676fd39793847b4bac35fc192fa49f96556496","last_reissued_at":"2026-05-18T04:01:00.527255Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:01:00.527255Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.0510","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:01:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n+/P2h49wncVg23HU1GBBO8rcZwnfe+aFc3KdmLDaFMPCZzkqVH+q+d0svAXyuw+lVqCTFI+dV1Jq3R6SoD8DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T07:45:54.984868Z"},"content_sha256":"2372412f4299c878705fbb380404a9a8d37f74cd0ff988b4217f82fdbf69d53f","schema_version":"1.0","event_id":"sha256:2372412f4299c878705fbb380404a9a8d37f74cd0ff988b4217f82fdbf69d53f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:SRKHSDSP32GEIHBQA3Y4QZ3P2O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the decay of crossing numbers of sparse graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gelasio Salazar, Jesus Leanos, Jozsef Balogh","submitted_at":"2012-03-02T16:21:32Z","abstract_excerpt":"Richter and Thomassen proved that every graph has an edge $e$ such that the crossing number $\\ucr(G-e)$ of $G-e$ is at least $(2/5)\\ucr(G) - O(1)$. Fox and Cs. T\\'oth proved that dense graphs have large sets of edges (proportional in the total number of edges) whose removal leaves a graph with crossing number proportional to the crossing number of the original graph; this result was later strenghtened by \\v{C}ern\\'{y}, Kyn\\v{c}l and G. T\\'oth. These results make our understanding of the {decay} of crossing numbers in dense graphs essentially complete. In this paper we prove a similar result fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.0510","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:01:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JxP+ScT5NIIRdzK651+qdKPRI78O1OwrFrhvILlgrhS80CQPleL7926FZ6SfmnH8iMTVuugprshH+w2565UyDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T07:45:54.985527Z"},"content_sha256":"a152963ab2b72c231a74d0699dde94976ec119a98872c64d5b1b21633f2aebfa","schema_version":"1.0","event_id":"sha256:a152963ab2b72c231a74d0699dde94976ec119a98872c64d5b1b21633f2aebfa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SRKHSDSP32GEIHBQA3Y4QZ3P2O/bundle.json","state_url":"https://pith.science/pith/SRKHSDSP32GEIHBQA3Y4QZ3P2O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SRKHSDSP32GEIHBQA3Y4QZ3P2O/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-09T07:45:54Z","links":{"resolver":"https://pith.science/pith/SRKHSDSP32GEIHBQA3Y4QZ3P2O","bundle":"https://pith.science/pith/SRKHSDSP32GEIHBQA3Y4QZ3P2O/bundle.json","state":"https://pith.science/pith/SRKHSDSP32GEIHBQA3Y4QZ3P2O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SRKHSDSP32GEIHBQA3Y4QZ3P2O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:SRKHSDSP32GEIHBQA3Y4QZ3P2O","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":"266e56d72813d35388aaafb4c40ca1339bee63bb6b87794d8c40814141c6058e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-02T16:21:32Z","title_canon_sha256":"1f9e74524c74df57040e557029161778a03d894543faea4c6804b9585e64a351"},"schema_version":"1.0","source":{"id":"1203.0510","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.0510","created_at":"2026-05-18T04:01:00Z"},{"alias_kind":"arxiv_version","alias_value":"1203.0510v1","created_at":"2026-05-18T04:01:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.0510","created_at":"2026-05-18T04:01:00Z"},{"alias_kind":"pith_short_12","alias_value":"SRKHSDSP32GE","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"SRKHSDSP32GEIHBQ","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"SRKHSDSP","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:a152963ab2b72c231a74d0699dde94976ec119a98872c64d5b1b21633f2aebfa","target":"graph","created_at":"2026-05-18T04:01:00Z","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":"Richter and Thomassen proved that every graph has an edge $e$ such that the crossing number $\\ucr(G-e)$ of $G-e$ is at least $(2/5)\\ucr(G) - O(1)$. Fox and Cs. T\\'oth proved that dense graphs have large sets of edges (proportional in the total number of edges) whose removal leaves a graph with crossing number proportional to the crossing number of the original graph; this result was later strenghtened by \\v{C}ern\\'{y}, Kyn\\v{c}l and G. T\\'oth. These results make our understanding of the {decay} of crossing numbers in dense graphs essentially complete. In this paper we prove a similar result fo","authors_text":"Gelasio Salazar, Jesus Leanos, Jozsef Balogh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-02T16:21:32Z","title":"On the decay of crossing numbers of sparse graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.0510","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:2372412f4299c878705fbb380404a9a8d37f74cd0ff988b4217f82fdbf69d53f","target":"record","created_at":"2026-05-18T04:01:00Z","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":"266e56d72813d35388aaafb4c40ca1339bee63bb6b87794d8c40814141c6058e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-02T16:21:32Z","title_canon_sha256":"1f9e74524c74df57040e557029161778a03d894543faea4c6804b9585e64a351"},"schema_version":"1.0","source":{"id":"1203.0510","kind":"arxiv","version":1}},"canonical_sha256":"9454790e4fde8c441c3006f1c8676fd39793847b4bac35fc192fa49f96556496","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9454790e4fde8c441c3006f1c8676fd39793847b4bac35fc192fa49f96556496","first_computed_at":"2026-05-18T04:01:00.527255Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:01:00.527255Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"abVRBf5PHPMvt6GMicOwV9D4tc+VoDj+ZfctHmJJ3V6grCETRLnTAXjsKk3MXa1/zmvxCPrYNUOcYOZt4ELhDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:01:00.528109Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.0510","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2372412f4299c878705fbb380404a9a8d37f74cd0ff988b4217f82fdbf69d53f","sha256:a152963ab2b72c231a74d0699dde94976ec119a98872c64d5b1b21633f2aebfa"],"state_sha256":"5a1ab5736484ae574edf86feebf0f1ef0faf95ad7aa54969385481b10c97802d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qHLA3TWwsqV58ZV6o85GMUECbokR1WLTuFCzvVeyUCpE/NmMMP9ce+eMOFa8UNF3itsz1eoM09p4NvgJ8SXIDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T07:45:54.988990Z","bundle_sha256":"b0ebd56accfc6cb0093590c5e8532231828cc8d9177801876b9b1584738fb27c"}}