{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:SRKHSDSP32GEIHBQA3Y4QZ3P2O","short_pith_number":"pith:SRKHSDSP","schema_version":"1.0","canonical_sha256":"9454790e4fde8c441c3006f1c8676fd39793847b4bac35fc192fa49f96556496","source":{"kind":"arxiv","id":"1203.0510","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1203.0510","created_at":"2026-05-18T04:01:00.527430+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.0510v1","created_at":"2026-05-18T04:01:00.527430+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.0510","created_at":"2026-05-18T04:01:00.527430+00:00"},{"alias_kind":"pith_short_12","alias_value":"SRKHSDSP32GE","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_16","alias_value":"SRKHSDSP32GEIHBQ","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_8","alias_value":"SRKHSDSP","created_at":"2026-05-18T12:27:20.899486+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/SRKHSDSP32GEIHBQA3Y4QZ3P2O","json":"https://pith.science/pith/SRKHSDSP32GEIHBQA3Y4QZ3P2O.json","graph_json":"https://pith.science/api/pith-number/SRKHSDSP32GEIHBQA3Y4QZ3P2O/graph.json","events_json":"https://pith.science/api/pith-number/SRKHSDSP32GEIHBQA3Y4QZ3P2O/events.json","paper":"https://pith.science/paper/SRKHSDSP"},"agent_actions":{"view_html":"https://pith.science/pith/SRKHSDSP32GEIHBQA3Y4QZ3P2O","download_json":"https://pith.science/pith/SRKHSDSP32GEIHBQA3Y4QZ3P2O.json","view_paper":"https://pith.science/paper/SRKHSDSP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.0510&json=true","fetch_graph":"https://pith.science/api/pith-number/SRKHSDSP32GEIHBQA3Y4QZ3P2O/graph.json","fetch_events":"https://pith.science/api/pith-number/SRKHSDSP32GEIHBQA3Y4QZ3P2O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SRKHSDSP32GEIHBQA3Y4QZ3P2O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SRKHSDSP32GEIHBQA3Y4QZ3P2O/action/storage_attestation","attest_author":"https://pith.science/pith/SRKHSDSP32GEIHBQA3Y4QZ3P2O/action/author_attestation","sign_citation":"https://pith.science/pith/SRKHSDSP32GEIHBQA3Y4QZ3P2O/action/citation_signature","submit_replication":"https://pith.science/pith/SRKHSDSP32GEIHBQA3Y4QZ3P2O/action/replication_record"}},"created_at":"2026-05-18T04:01:00.527430+00:00","updated_at":"2026-05-18T04:01:00.527430+00:00"}