{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:LC232NKXOT7KCPAFU37V2G257M","short_pith_number":"pith:LC232NKX","schema_version":"1.0","canonical_sha256":"58b5bd355774fea13c05a6ff5d1b5dfb3ec75a1cf7bfbe985697c66e4251436a","source":{"kind":"arxiv","id":"1201.5421","version":1},"attestation_state":"computed","paper":{"title":"Improvement on the decay of crossing numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"G\\'eza T\\'oth, Jakub \\v{C}ern\\'y, Jan Kyn\\v{c}l","submitted_at":"2012-01-26T01:15:44Z","abstract_excerpt":"We prove that the crossing number of a graph decays in a continuous fashion in the following sense. For any epsilon>0 there is a delta>0 such that for a sufficiently large n, every graph G with n vertices and m > n^{1+epsilon} edges, has a subgraph G' of at most (1-delta)m edges and crossing number at least (1-epsilon)cr(G). This generalizes the result of J. Fox and Cs. Toth."},"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":"1201.5421","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-01-26T01:15:44Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"0447c1d8bebd62aa869bcf5d7ca27546468646c79899e8c4f19883119e0f6a40","abstract_canon_sha256":"2c727d2069f999cc83dd840c323ce4094d93fdcb688b30327c268c443d7496ae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:16:40.603965Z","signature_b64":"kPMP41H91biLb2ezSymW0JukeH/OmvgZ0T0gbwOkvjhOTVGD/RttwJ4nietmCegPX7TgseA6cwyqBlviMZhUBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58b5bd355774fea13c05a6ff5d1b5dfb3ec75a1cf7bfbe985697c66e4251436a","last_reissued_at":"2026-05-18T03:16:40.602244Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:16:40.602244Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improvement on the decay of crossing numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"G\\'eza T\\'oth, Jakub \\v{C}ern\\'y, Jan Kyn\\v{c}l","submitted_at":"2012-01-26T01:15:44Z","abstract_excerpt":"We prove that the crossing number of a graph decays in a continuous fashion in the following sense. For any epsilon>0 there is a delta>0 such that for a sufficiently large n, every graph G with n vertices and m > n^{1+epsilon} edges, has a subgraph G' of at most (1-delta)m edges and crossing number at least (1-epsilon)cr(G). This generalizes the result of J. Fox and Cs. Toth."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.5421","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":"1201.5421","created_at":"2026-05-18T03:16:40.603449+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.5421v1","created_at":"2026-05-18T03:16:40.603449+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.5421","created_at":"2026-05-18T03:16:40.603449+00:00"},{"alias_kind":"pith_short_12","alias_value":"LC232NKXOT7K","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"LC232NKXOT7KCPAF","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"LC232NKX","created_at":"2026-05-18T12:27:14.488303+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/LC232NKXOT7KCPAFU37V2G257M","json":"https://pith.science/pith/LC232NKXOT7KCPAFU37V2G257M.json","graph_json":"https://pith.science/api/pith-number/LC232NKXOT7KCPAFU37V2G257M/graph.json","events_json":"https://pith.science/api/pith-number/LC232NKXOT7KCPAFU37V2G257M/events.json","paper":"https://pith.science/paper/LC232NKX"},"agent_actions":{"view_html":"https://pith.science/pith/LC232NKXOT7KCPAFU37V2G257M","download_json":"https://pith.science/pith/LC232NKXOT7KCPAFU37V2G257M.json","view_paper":"https://pith.science/paper/LC232NKX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.5421&json=true","fetch_graph":"https://pith.science/api/pith-number/LC232NKXOT7KCPAFU37V2G257M/graph.json","fetch_events":"https://pith.science/api/pith-number/LC232NKXOT7KCPAFU37V2G257M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LC232NKXOT7KCPAFU37V2G257M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LC232NKXOT7KCPAFU37V2G257M/action/storage_attestation","attest_author":"https://pith.science/pith/LC232NKXOT7KCPAFU37V2G257M/action/author_attestation","sign_citation":"https://pith.science/pith/LC232NKXOT7KCPAFU37V2G257M/action/citation_signature","submit_replication":"https://pith.science/pith/LC232NKXOT7KCPAFU37V2G257M/action/replication_record"}},"created_at":"2026-05-18T03:16:40.603449+00:00","updated_at":"2026-05-18T03:16:40.603449+00:00"}