{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:CVPMRBSESLK5MQOZ5NPHPBIE6J","short_pith_number":"pith:CVPMRBSE","schema_version":"1.0","canonical_sha256":"155ec8864492d5d641d9eb5e778504f24d5e9330923782a20ca2ffb1544f03cc","source":{"kind":"arxiv","id":"2307.08165","version":2},"attestation_state":"computed","paper":{"title":"On short edges in complete topological graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.CO","authors_text":"Andrew Suk","submitted_at":"2023-07-16T22:21:17Z","abstract_excerpt":"Let $h(n)$ be the minimum integer such that every complete $n$-vertex simple topological graph contains an edge that crosses at most $h(n)$ other edges. In 2009, Kyn\\v{c}l and Valtr showed that $h(n) = O(n^2/\\log^{1/4} n)$, and in the other direction, gave constructions showing that $h(n) = \\Omega(n^{3/2})$. In this paper, we prove that $h(n) = O(n^{7/4})$. Along the way, we establish a new variant of Chazelle and Welzl's matching theorem for set systems with bounded VC-dimension, which we believe to be of independent interest."},"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":"2307.08165","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-07-16T22:21:17Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"7b1b9795c5110998075bb1fd540071ea83efdf4f4bb30041d7fd4c4c7ad6df6d","abstract_canon_sha256":"31f89ec9583845631ef550793d80acd9775f0d8c17f8227e508e79abd213b471"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:19:20.852268Z","signature_b64":"dSbJg47hZyOb4jvbzvcDXzHbaCfzDB+VQXoyHCHbuUF6bKXmT4aBNJOB8DRfxdsHbUOUJ/+SeQmzmWPCUMHhBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"155ec8864492d5d641d9eb5e778504f24d5e9330923782a20ca2ffb1544f03cc","last_reissued_at":"2026-07-05T07:19:20.851814Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:19:20.851814Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On short edges in complete topological graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.CO","authors_text":"Andrew Suk","submitted_at":"2023-07-16T22:21:17Z","abstract_excerpt":"Let $h(n)$ be the minimum integer such that every complete $n$-vertex simple topological graph contains an edge that crosses at most $h(n)$ other edges. In 2009, Kyn\\v{c}l and Valtr showed that $h(n) = O(n^2/\\log^{1/4} n)$, and in the other direction, gave constructions showing that $h(n) = \\Omega(n^{3/2})$. In this paper, we prove that $h(n) = O(n^{7/4})$. Along the way, we establish a new variant of Chazelle and Welzl's matching theorem for set systems with bounded VC-dimension, which we believe to be of independent interest."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.08165","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2307.08165/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2307.08165","created_at":"2026-07-05T07:19:20.851875+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.08165v2","created_at":"2026-07-05T07:19:20.851875+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.08165","created_at":"2026-07-05T07:19:20.851875+00:00"},{"alias_kind":"pith_short_12","alias_value":"CVPMRBSESLK5","created_at":"2026-07-05T07:19:20.851875+00:00"},{"alias_kind":"pith_short_16","alias_value":"CVPMRBSESLK5MQOZ","created_at":"2026-07-05T07:19:20.851875+00:00"},{"alias_kind":"pith_short_8","alias_value":"CVPMRBSE","created_at":"2026-07-05T07:19:20.851875+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.09576","citing_title":"Interpolating chromatic and homomorphism thresholds","ref_index":44,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CVPMRBSESLK5MQOZ5NPHPBIE6J","json":"https://pith.science/pith/CVPMRBSESLK5MQOZ5NPHPBIE6J.json","graph_json":"https://pith.science/api/pith-number/CVPMRBSESLK5MQOZ5NPHPBIE6J/graph.json","events_json":"https://pith.science/api/pith-number/CVPMRBSESLK5MQOZ5NPHPBIE6J/events.json","paper":"https://pith.science/paper/CVPMRBSE"},"agent_actions":{"view_html":"https://pith.science/pith/CVPMRBSESLK5MQOZ5NPHPBIE6J","download_json":"https://pith.science/pith/CVPMRBSESLK5MQOZ5NPHPBIE6J.json","view_paper":"https://pith.science/paper/CVPMRBSE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.08165&json=true","fetch_graph":"https://pith.science/api/pith-number/CVPMRBSESLK5MQOZ5NPHPBIE6J/graph.json","fetch_events":"https://pith.science/api/pith-number/CVPMRBSESLK5MQOZ5NPHPBIE6J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CVPMRBSESLK5MQOZ5NPHPBIE6J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CVPMRBSESLK5MQOZ5NPHPBIE6J/action/storage_attestation","attest_author":"https://pith.science/pith/CVPMRBSESLK5MQOZ5NPHPBIE6J/action/author_attestation","sign_citation":"https://pith.science/pith/CVPMRBSESLK5MQOZ5NPHPBIE6J/action/citation_signature","submit_replication":"https://pith.science/pith/CVPMRBSESLK5MQOZ5NPHPBIE6J/action/replication_record"}},"created_at":"2026-07-05T07:19:20.851875+00:00","updated_at":"2026-07-05T07:19:20.851875+00:00"}