{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:WMIODF3IB2V6LZZ5TZLIKI7GEV","short_pith_number":"pith:WMIODF3I","schema_version":"1.0","canonical_sha256":"b310e197680eabe5e73d9e568523e6256f676738a641c67e700bf266dd094dff","source":{"kind":"arxiv","id":"1811.08071","version":1},"attestation_state":"computed","paper":{"title":"Midrange crossing constants for graphs classes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"\\'Eva Czabarka, Josiah Reiswig, L\\'aszl\\'o Sz\\'ekely, Zhiyu Wang","submitted_at":"2018-11-20T04:37:53Z","abstract_excerpt":"For positive integers $n$ and $e$, let $\\kappa(n,e)$ be the minimum crossing number (the standard planar crossing number) taken over all graphs with $n$ vertices and at least $e$ edges. Pach, Spencer and T\\'oth [Discrete and Computational Geometry 24 623--644, (2000)] showed that $\\kappa(n,e) n^2/e^3$ tends to a positive constant (called midrange crossing constant) as $n\\to \\infty$ and $n \\ll e \\ll n^2$, proving a conjecture of Erd\\H{o}s and Guy. In this note, we extend their proof to show that the midrange crossing constant exists for graph classes that satisfy a certain set of graph properti"},"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":"1811.08071","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-20T04:37:53Z","cross_cats_sorted":[],"title_canon_sha256":"efb4da0f7a55b952aad82cf271b4ef5e2de770d58e4a50fa2756d6e4c573a3cf","abstract_canon_sha256":"174a5f627e55251614c070f2bb6fcb3a66b580347604d9560e8ccd30f991f5aa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:16.954623Z","signature_b64":"Lov1gn07meuZJPQIkIN0/pDXrw18ygn5TeoPZIr6sW6FknpM+56Uhs9vBFoUfWu8S8hapFkJltYUnBAx7qfhDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b310e197680eabe5e73d9e568523e6256f676738a641c67e700bf266dd094dff","last_reissued_at":"2026-05-18T00:00:16.953952Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:16.953952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Midrange crossing constants for graphs classes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"\\'Eva Czabarka, Josiah Reiswig, L\\'aszl\\'o Sz\\'ekely, Zhiyu Wang","submitted_at":"2018-11-20T04:37:53Z","abstract_excerpt":"For positive integers $n$ and $e$, let $\\kappa(n,e)$ be the minimum crossing number (the standard planar crossing number) taken over all graphs with $n$ vertices and at least $e$ edges. Pach, Spencer and T\\'oth [Discrete and Computational Geometry 24 623--644, (2000)] showed that $\\kappa(n,e) n^2/e^3$ tends to a positive constant (called midrange crossing constant) as $n\\to \\infty$ and $n \\ll e \\ll n^2$, proving a conjecture of Erd\\H{o}s and Guy. In this note, we extend their proof to show that the midrange crossing constant exists for graph classes that satisfy a certain set of graph properti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.08071","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":"1811.08071","created_at":"2026-05-18T00:00:16.954047+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.08071v1","created_at":"2026-05-18T00:00:16.954047+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.08071","created_at":"2026-05-18T00:00:16.954047+00:00"},{"alias_kind":"pith_short_12","alias_value":"WMIODF3IB2V6","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"WMIODF3IB2V6LZZ5","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"WMIODF3I","created_at":"2026-05-18T12:33:01.666342+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.00368","citing_title":"Some remarks on the midrange crossing constant","ref_index":6,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WMIODF3IB2V6LZZ5TZLIKI7GEV","json":"https://pith.science/pith/WMIODF3IB2V6LZZ5TZLIKI7GEV.json","graph_json":"https://pith.science/api/pith-number/WMIODF3IB2V6LZZ5TZLIKI7GEV/graph.json","events_json":"https://pith.science/api/pith-number/WMIODF3IB2V6LZZ5TZLIKI7GEV/events.json","paper":"https://pith.science/paper/WMIODF3I"},"agent_actions":{"view_html":"https://pith.science/pith/WMIODF3IB2V6LZZ5TZLIKI7GEV","download_json":"https://pith.science/pith/WMIODF3IB2V6LZZ5TZLIKI7GEV.json","view_paper":"https://pith.science/paper/WMIODF3I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.08071&json=true","fetch_graph":"https://pith.science/api/pith-number/WMIODF3IB2V6LZZ5TZLIKI7GEV/graph.json","fetch_events":"https://pith.science/api/pith-number/WMIODF3IB2V6LZZ5TZLIKI7GEV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WMIODF3IB2V6LZZ5TZLIKI7GEV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WMIODF3IB2V6LZZ5TZLIKI7GEV/action/storage_attestation","attest_author":"https://pith.science/pith/WMIODF3IB2V6LZZ5TZLIKI7GEV/action/author_attestation","sign_citation":"https://pith.science/pith/WMIODF3IB2V6LZZ5TZLIKI7GEV/action/citation_signature","submit_replication":"https://pith.science/pith/WMIODF3IB2V6LZZ5TZLIKI7GEV/action/replication_record"}},"created_at":"2026-05-18T00:00:16.954047+00:00","updated_at":"2026-05-18T00:00:16.954047+00:00"}